Base | Representation |
---|---|
bin | 1001011101100000111001… |
… | …0001111000110011001000 |
3 | 1100211111001120220220122220 |
4 | 2113120032101320303020 |
5 | 2330414111443023112 |
6 | 34042524523414040 |
7 | 2122365242056356 |
oct | 227301621706310 |
9 | 40744046826586 |
10 | 10402650361032 |
11 | 3350814a28936 |
12 | 120012a684320 |
13 | 5a5c728c0317 |
14 | 27d6c32c27d6 |
15 | 1308e436898c |
hex | 9760e478cc8 |
10402650361032 has 64 divisors (see below), whose sum is σ = 26044890746880. Its totient is φ = 3462450311232.
The previous prime is 10402650361001. The next prime is 10402650361039. The reversal of 10402650361032 is 23016305620401.
It is a junction number, because it is equal to n+sod(n) for n = 10402650360984 and 10402650361002.
It is not an unprimeable number, because it can be changed into a prime (10402650361039) 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, 79475913 + ... + 79606695.
It is an arithmetic number, because the mean of its divisors is an integer number (406951417920).
Almost surely, 210402650361032 is an apocalyptic number.
10402650361032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10402650361032 is an abundant number, since it is smaller than the sum of its proper divisors (15642240385848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10402650361032 is a wasteful number, since it uses less digits than its factorization.
10402650361032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 135642 (or 135638 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 33.
Adding to 10402650361032 its reverse (23016305620401), we get a palindrome (33418955981433).
The spelling of 10402650361032 in words is "ten trillion, four hundred two billion, six hundred fifty million, three hundred sixty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •