Base | Representation |
---|---|
bin | 1000000001000110… |
… | …1100001111100001 |
3 | 12112222121002102210 |
4 | 2000101230033201 |
5 | 13401420340223 |
6 | 553315232333 |
7 | 104221505106 |
oct | 20021541741 |
9 | 5488532383 |
10 | 2152121313 |
11 | a048a8661 |
12 | 5008a86a9 |
13 | 283b39984 |
14 | 165b76aad |
15 | c8e10893 |
hex | 8046c3e1 |
2152121313 has 8 divisors (see below), whose sum is σ = 2885349376. Its totient is φ = 1426820400.
The previous prime is 2152121261. The next prime is 2152121329. The reversal of 2152121313 is 3131212512.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2152121313 - 222 = 2147927009 is a prime.
It is a super-2 number, since 2×21521213132 = 9263252291737687938, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2152121313.
It is not an unprimeable number, because it can be changed into a prime (2152121113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1981153 + ... + 1982238.
It is an arithmetic number, because the mean of its divisors is an integer number (360668672).
Almost surely, 22152121313 is an apocalyptic number.
It is an amenable number.
2152121313 is a deficient number, since it is larger than the sum of its proper divisors (733228063).
2152121313 is a wasteful number, since it uses less digits than its factorization.
2152121313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3963575.
The product of its digits is 360, while the sum is 21.
The square root of 2152121313 is about 46390.9615442491. The cubic root of 2152121313 is about 1291.0872217569.
Adding to 2152121313 its reverse (3131212512), we get a palindrome (5283333825).
The spelling of 2152121313 in words is "two billion, one hundred fifty-two million, one hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •