Base | Representation |
---|---|
bin | 1001101011100001111110… |
… | …1011010101000000001001 |
3 | 1101200111122001111221212022 |
4 | 2122320133223111000021 |
5 | 2343340301331131101 |
6 | 34345312130454225 |
7 | 2145651604530146 |
oct | 232703753250011 |
9 | 41614561457768 |
10 | 10643460411401 |
11 | 3433958a22994 |
12 | 123a935434375 |
13 | 5c289ba5339c |
14 | 28b2093953cd |
15 | 136cda484a1b |
hex | 9ae1fad5009 |
10643460411401 has 24 divisors (see below), whose sum is σ = 11317614687720. Its totient is φ = 9974825527296.
The previous prime is 10643460411281. The next prime is 10643460411431. The reversal of 10643460411401 is 10411406434601.
It can be written as a sum of positive squares in 4 ways, for example, as 50055625 + 10643410355776 = 7075^2 + 3262424^2 .
It is not a de Polignac number, because 10643460411401 - 226 = 10643393302537 is a prime.
It is a super-2 number, since 2×106434604114012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10643460411431) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3584862245 + ... + 3584865213.
It is an arithmetic number, because the mean of its divisors is an integer number (471567278655).
Almost surely, 210643460411401 is an apocalyptic number.
It is an amenable number.
10643460411401 is a deficient number, since it is larger than the sum of its proper divisors (674154276319).
10643460411401 is an equidigital number, since it uses as much as digits as its factorization.
10643460411401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6185 (or 5902 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 35.
The spelling of 10643460411401 in words is "ten trillion, six hundred forty-three billion, four hundred sixty million, four hundred eleven thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •