Base | Representation |
---|---|
bin | 1001101001000101011000… |
… | …0101000100010001111000 |
3 | 1101112111010102120022222012 |
4 | 2122101112011010101320 |
5 | 2342143203401032402 |
6 | 34314120544545052 |
7 | 2142633104355032 |
oct | 232212605042170 |
9 | 41474112508865 |
10 | 10601423455352 |
11 | 34180471866a4 |
12 | 1232763322188 |
13 | 5bb92c9875b2 |
14 | 28917c46cc52 |
15 | 135b79c3a452 |
hex | 9a456144478 |
10601423455352 has 16 divisors (see below), whose sum is σ = 19882751540400. Its totient is φ = 5299356377920.
The previous prime is 10601423455351. The next prime is 10601423455411. The reversal of 10601423455352 is 25355432410601.
It is a super-2 number, since 2×106014234553522 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10601423455351) 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 3 ways as a sum of consecutive naturals, for example, 169385477 + ... + 169448052.
It is an arithmetic number, because the mean of its divisors is an integer number (1242671971275).
Almost surely, 210601423455352 is an apocalyptic number.
It is an amenable number.
10601423455352 is a deficient number, since it is larger than the sum of its proper divisors (9281328085048).
10601423455352 is a wasteful number, since it uses less digits than its factorization.
10601423455352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 338837446 (or 338837442 counting only the distinct ones).
The product of its (nonzero) digits is 432000, while the sum is 41.
Adding to 10601423455352 its reverse (25355432410601), we get a palindrome (35956855865953).
The spelling of 10601423455352 in words is "ten trillion, six hundred one billion, four hundred twenty-three million, four hundred fifty-five thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •