Base | Representation |
---|---|
bin | 10111001111101001011001… |
… | …011000101011111011110110 |
3 | 111101222010022011100201212012 |
4 | 113033221121120223323312 |
5 | 101344420134133114110 |
6 | 1001231542344324222 |
7 | 30350616261555044 |
oct | 2717513130537366 |
9 | 441863264321765 |
10 | 102230311223030 |
11 | 2a6346a4601701 |
12 | b570b04473672 |
13 | 450737a6bb7c3 |
14 | 1b35d8b283394 |
15 | bc43a1d24905 |
hex | 5cfa5962bef6 |
102230311223030 has 32 divisors (see below), whose sum is σ = 188973730417824. Its totient is φ = 39796952944896.
The previous prime is 102230311223011. The next prime is 102230311223071. The reversal of 102230311223030 is 30322113032201.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 102230311222987 and 102230311223005.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 429023327 + ... + 429261546.
It is an arithmetic number, because the mean of its divisors is an integer number (5905429075557).
Almost surely, 2102230311223030 is an apocalyptic number.
102230311223030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102230311223030 is a deficient number, since it is larger than the sum of its proper divisors (86743419194794).
102230311223030 is a wasteful number, since it uses less digits than its factorization.
102230311223030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 858285200.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 102230311223030 its reverse (30322113032201), we get a palindrome (132552424255231).
The spelling of 102230311223030 in words is "one hundred two trillion, two hundred thirty billion, three hundred eleven million, two hundred twenty-three thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •