Base | Representation |
---|---|
bin | 1001001101000100000001… |
… | …0001010010011011010011 |
3 | 1022211110112200100002222102 |
4 | 2103101000101102123103 |
5 | 2311301300413114443 |
6 | 33305023520231015 |
7 | 2063101363041560 |
oct | 223210021223323 |
9 | 38743480302872 |
10 | 10120021223123 |
11 | 3251971174409 |
12 | 11753b276b46b |
13 | 585410863946 |
14 | 26db511db867 |
15 | 1283a1bdbcb8 |
hex | 934404526d3 |
10120021223123 has 16 divisors (see below), whose sum is σ = 11569902888960. Its totient is φ = 8671181270976.
The previous prime is 10120021223113. The next prime is 10120021223177. The reversal of 10120021223123 is 32132212002101.
It is not a de Polignac number, because 10120021223123 - 210 = 10120021222099 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10120021223095 and 10120021223104.
It is not an unprimeable number, because it can be changed into a prime (10120021223113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 252016415 + ... + 252056567.
It is an arithmetic number, because the mean of its divisors is an integer number (723118930560).
Almost surely, 210120021223123 is an apocalyptic number.
10120021223123 is a deficient number, since it is larger than the sum of its proper divisors (1449881665837).
10120021223123 is an equidigital number, since it uses as much as digits as its factorization.
10120021223123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52226.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 10120021223123 its reverse (32132212002101), we get a palindrome (42252233225224).
The spelling of 10120021223123 in words is "ten trillion, one hundred twenty billion, twenty-one million, two hundred twenty-three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •