Base | Representation |
---|---|
bin | 1001100001000110000001… |
… | …0000000001100010100001 |
3 | 1101001100210222000201212120 |
4 | 2120101200100001202201 |
5 | 2332421042204141101 |
6 | 34131055544414453 |
7 | 2130003343112415 |
oct | 230214020014241 |
9 | 41040728021776 |
10 | 10464155146401 |
11 | 3374906864470 |
12 | 1210034477429 |
13 | 5ab9c5026948 |
14 | 282679962d45 |
15 | 1322e3c5db36 |
hex | 984604018a1 |
10464155146401 has 16 divisors (see below), whose sum is σ = 15235614613440. Its totient is φ = 6335651664320.
The previous prime is 10464155146351. The next prime is 10464155146411.
It is a happy number.
10464155146401 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 10464155146401 - 27 = 10464155146273 is a prime.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (10464155146411) 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, 156479706 + ... + 156546563.
It is an arithmetic number, because the mean of its divisors is an integer number (952225913340).
Almost surely, 210464155146401 is an apocalyptic number.
10464155146401 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10464155146401 is a deficient number, since it is larger than the sum of its proper divisors (4771459467039).
10464155146401 is a wasteful number, since it uses less digits than its factorization.
10464155146401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 313027296.
The product of its (nonzero) digits is 230400, while the sum is 42.
The spelling of 10464155146401 in words is "ten trillion, four hundred sixty-four billion, one hundred fifty-five million, one hundred forty-six thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •