Base | Representation |
---|---|
bin | 10111001111100010100101… |
… | …100111000101000111011010 |
3 | 111101221102102122020201200020 |
4 | 113033202211213011013122 |
5 | 101344310201013130020 |
6 | 1001224333054251310 |
7 | 30350240144365044 |
oct | 2717424547050732 |
9 | 441842378221606 |
10 | 102223000130010 |
11 | 2a631592697271 |
12 | b56b603ab6b36 |
13 | 4506783b02866 |
14 | 1b358962a6a94 |
15 | bc40c5059c40 |
hex | 5cf8a59c51da |
102223000130010 has 64 divisors (see below), whose sum is σ = 251335092758400. Its totient is φ = 26592897208320.
The previous prime is 102223000129961. The next prime is 102223000130023. The reversal of 102223000130010 is 10031000322201.
102223000130010 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16592889 + ... + 21903651.
It is an arithmetic number, because the mean of its divisors is an integer number (3927110824350).
Almost surely, 2102223000130010 is an apocalyptic number.
102223000130010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102223000130010 is an abundant number, since it is smaller than the sum of its proper divisors (149112092628390).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102223000130010 is a wasteful number, since it uses less digits than its factorization.
102223000130010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5326463.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 102223000130010 its reverse (10031000322201), we get a palindrome (112254000452211).
The spelling of 102223000130010 in words is "one hundred two trillion, two hundred twenty-three billion, one hundred thirty thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.538 sec. • engine limits •