Base | Representation |
---|---|
bin | 1001001110111000101111… |
… | …0011010010111000011001 |
3 | 1022221110102020222110100010 |
4 | 2103232023303102320121 |
5 | 2312304432404401103 |
6 | 33331244533232133 |
7 | 2065260665332434 |
oct | 223561363227031 |
9 | 38843366873303 |
10 | 10151353200153 |
11 | 326418a266500 |
12 | 117b497792649 |
13 | 588364b7b819 |
14 | 2714844cc81b |
15 | 1290d7720903 |
hex | 93b8bcd2e19 |
10151353200153 has 12 divisors (see below), whose sum is σ = 14877465296624. Its totient is φ = 6152335272600.
The previous prime is 10151353200077. The next prime is 10151353200161. The reversal of 10151353200153 is 35100235315101.
It is not a de Polignac number, because 10151353200153 - 213 = 10151353191961 is a prime.
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 10151353200153.
It is not an unprimeable number, because it can be changed into a prime (10151353200953) 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 11 ways as a sum of consecutive naturals, for example, 13982579803 + ... + 13982580528.
Almost surely, 210151353200153 is an apocalyptic number.
It is an amenable number.
10151353200153 is a deficient number, since it is larger than the sum of its proper divisors (4726112096471).
10151353200153 is a wasteful number, since it uses less digits than its factorization.
10151353200153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27965160356 (or 27965160345 counting only the distinct ones).
The product of its (nonzero) digits is 6750, while the sum is 30.
Adding to 10151353200153 its reverse (35100235315101), we get a palindrome (45251588515254).
The spelling of 10151353200153 in words is "ten trillion, one hundred fifty-one billion, three hundred fifty-three million, two hundred thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •