Base | Representation |
---|---|
bin | 11101000110111011011… |
… | …01001001001011111100 |
3 | 10112121120022110102002012 |
4 | 32203131231021023330 |
5 | 112341302403332031 |
6 | 2043244040350352 |
7 | 132154461554210 |
oct | 16433555111374 |
9 | 3477508412065 |
10 | 1000152011516 |
11 | 356186811449 |
12 | 141a04a753b8 |
13 | 73410920198 |
14 | 3659c6d6940 |
15 | 1b039c91b2b |
hex | e8ddb492fc |
1000152011516 has 24 divisors (see below), whose sum is σ = 2000348184576. Its totient is φ = 428627113200.
The previous prime is 1000152011497. The next prime is 1000152011543. The reversal of 1000152011516 is 6151102510001.
It is a super-2 number, since 2×10001520115162 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1000152011491 and 1000152011500.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 980741 + ... + 1721091.
It is an arithmetic number, because the mean of its divisors is an integer number (83347841024).
Almost surely, 21000152011516 is an apocalyptic number.
It is an amenable number.
1000152011516 is an abundant number, since it is smaller than the sum of its proper divisors (1000196173060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000152011516 is a wasteful number, since it uses less digits than its factorization.
1000152011516 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 788609 (or 788607 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 23.
Adding to 1000152011516 its reverse (6151102510001), we get a palindrome (7151254521517).
The spelling of 1000152011516 in words is "one trillion, one hundred fifty-two million, eleven thousand, five hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •