Base | Representation |
---|---|
bin | 1001101110111001100001… |
… | …1101101011101011001010 |
3 | 1101220000222111021101020122 |
4 | 2123232120131223223022 |
5 | 2400312301242432414 |
6 | 34432041425423242 |
7 | 2153100502336250 |
oct | 233563035535312 |
9 | 41800874241218 |
10 | 10701321452234 |
11 | 345644aa822a6 |
12 | 1249ba2a9ab22 |
13 | 5c819030185a |
14 | 28dd37b3a5d0 |
15 | 138575026b8e |
hex | 9bb9876baca |
10701321452234 has 32 divisors (see below), whose sum is σ = 18947905385472. Its totient is φ = 4435756848000.
The previous prime is 10701321452233. The next prime is 10701321452243. The reversal of 10701321452234 is 43225412310701.
It is a happy number.
It is a super-2 number, since 2×107013214522342 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10701321452194 and 10701321452203.
It is not an unprimeable number, because it can be changed into a prime (10701321452233) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6416777 + ... + 7910604.
It is an arithmetic number, because the mean of its divisors is an integer number (592122043296).
Almost surely, 210701321452234 is an apocalyptic number.
10701321452234 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
10701321452234 is a deficient number, since it is larger than the sum of its proper divisors (8246583933238).
10701321452234 is a wasteful number, since it uses less digits than its factorization.
10701321452234 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14329142.
The product of its (nonzero) digits is 40320, while the sum is 35.
Adding to 10701321452234 its reverse (43225412310701), we get a palindrome (53926733762935).
The spelling of 10701321452234 in words is "ten trillion, seven hundred one billion, three hundred twenty-one million, four hundred fifty-two thousand, two hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •