Base | Representation |
---|---|
bin | 101111100011011111… |
… | …0000100011000011010 |
3 | 100202121002022210221001 |
4 | 1133012332010120122 |
5 | 3133121314014300 |
6 | 114525301335214 |
7 | 10243455066220 |
oct | 1370676043032 |
9 | 322532283831 |
10 | 102122407450 |
11 | 3a345489248 |
12 | 1796070750a |
13 | 982644473b |
14 | 4d2aca0b10 |
15 | 29ca72b16a |
hex | 17c6f8461a |
102122407450 has 96 divisors (see below), whose sum is σ = 229191580800. Its totient is φ = 33071431680.
The previous prime is 102122407423. The next prime is 102122407459. The reversal of 102122407450 is 54704221201.
It is a super-2 number, since 2×1021224074502 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (102122407459) by changing a digit.
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 in 47 ways as a sum of consecutive naturals, for example, 2218266 + ... + 2263834.
It is an arithmetic number, because the mean of its divisors is an integer number (2387412300).
Almost surely, 2102122407450 is an apocalyptic number.
102122407450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102122407450 is an abundant number, since it is smaller than the sum of its proper divisors (127069173350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102122407450 is a wasteful number, since it uses less digits than its factorization.
102122407450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45944 (or 45939 counting only the distinct ones).
The product of its (nonzero) digits is 4480, while the sum is 28.
Adding to 102122407450 its reverse (54704221201), we get a palindrome (156826628651).
The spelling of 102122407450 in words is "one hundred two billion, one hundred twenty-two million, four hundred seven thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •