Base | Representation |
---|---|
bin | 1001011000001000101101… |
… | …1010001111101100001000 |
3 | 1100111122120202221210111011 |
4 | 2112002023122033230020 |
5 | 2322410403132022212 |
6 | 33532245050413304 |
7 | 2112614602415614 |
oct | 226021332175410 |
9 | 40448522853434 |
10 | 10310260423432 |
11 | 3315614248302 |
12 | 11a6245431234 |
13 | 59a33a8c64a8 |
14 | 27903ac24344 |
15 | 12d2d82a24a7 |
hex | 9608b68fb08 |
10310260423432 has 8 divisors (see below), whose sum is σ = 19331738293950. Its totient is φ = 5155130211712.
The previous prime is 10310260423423. The next prime is 10310260423453. The reversal of 10310260423432 is 23432406201301.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 8056821110116 + 2253439313316 = 2838454^2 + 1501146^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a junction number, because it is equal to n+sod(n) for n = 10310260423394 and 10310260423403.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 644391276457 + ... + 644391276472.
Almost surely, 210310260423432 is an apocalyptic number.
It is an amenable number.
10310260423432 is a deficient number, since it is larger than the sum of its proper divisors (9021477870518).
10310260423432 is a wasteful number, since it uses less digits than its factorization.
10310260423432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1288782552935 (or 1288782552931 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 10310260423432 its reverse (23432406201301), we get a palindrome (33742666624733).
The spelling of 10310260423432 in words is "ten trillion, three hundred ten billion, two hundred sixty million, four hundred twenty-three thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •