Base | Representation |
---|---|
bin | 11110100101111100100… |
… | …10111110100100101001 |
3 | 10201111020110202202201100 |
4 | 33102332102332210221 |
5 | 114210241123304103 |
6 | 2122522014512013 |
7 | 135641561144640 |
oct | 17227622764451 |
9 | 3644213682640 |
10 | 1051164666153 |
11 | 375884060958 |
12 | 14b880b05609 |
13 | 7818040b024 |
14 | 38c3b70a357 |
15 | 1c5234b75a3 |
hex | f4be4be929 |
1051164666153 has 24 divisors (see below), whose sum is σ = 1759696189056. Its totient is φ = 592205443200.
The previous prime is 1051164666131. The next prime is 1051164666157. The reversal of 1051164666153 is 3516664611501.
It is not a de Polignac number, because 1051164666153 - 29 = 1051164665641 is a prime.
It is a super-2 number, since 2×10511646661532 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1051164666099 and 1051164666108.
It is not an unprimeable number, because it can be changed into a prime (1051164666157) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 117496608 + ... + 117505553.
It is an arithmetic number, because the mean of its divisors is an integer number (73320674544).
Almost surely, 21051164666153 is an apocalyptic number.
It is an amenable number.
1051164666153 is a deficient number, since it is larger than the sum of its proper divisors (708531522903).
1051164666153 is a wasteful number, since it uses less digits than its factorization.
1051164666153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 235002245 (or 235002242 counting only the distinct ones).
The product of its (nonzero) digits is 388800, while the sum is 45.
The spelling of 1051164666153 in words is "one trillion, fifty-one billion, one hundred sixty-four million, six hundred sixty-six thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •