Base | Representation |
---|---|
bin | 1001101011011110110110… |
… | …1010110000010101001000 |
3 | 1101200102110120202210010111 |
4 | 2122313231222300111020 |
5 | 2343332042034303032 |
6 | 34345052555524104 |
7 | 2145622036205002 |
oct | 232675552602510 |
9 | 41612416683114 |
10 | 10642621400392 |
11 | 3433568367563 |
12 | 123a740459634 |
13 | 5c2796c91b77 |
14 | 28b169b93372 |
15 | 136c8b9a3c47 |
hex | 9adedab0548 |
10642621400392 has 8 divisors (see below), whose sum is σ = 19954915125750. Its totient is φ = 5321310700192.
The previous prime is 10642621400267. The next prime is 10642621400393. The reversal of 10642621400392 is 29300412624601.
It is a happy number.
10642621400392 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 8311423766116 + 2331197634276 = 2882954^2 + 1526826^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×106426214003922 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10642621400393) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 665163837517 + ... + 665163837532.
Almost surely, 210642621400392 is an apocalyptic number.
It is an amenable number.
10642621400392 is a deficient number, since it is larger than the sum of its proper divisors (9312293725358).
10642621400392 is a wasteful number, since it uses less digits than its factorization.
10642621400392 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1330327675055 (or 1330327675051 counting only the distinct ones).
The product of its (nonzero) digits is 124416, while the sum is 40.
The spelling of 10642621400392 in words is "ten trillion, six hundred forty-two billion, six hundred twenty-one million, four hundred thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •