Base | Representation |
---|---|
bin | 10111011011001010101111… |
… | …100001000001001011000100 |
3 | 111111202210212102100110021010 |
4 | 113123022233201001023010 |
5 | 102000403104214331322 |
6 | 1003035400050322220 |
7 | 30462044643232632 |
oct | 2733125741011304 |
9 | 444683772313233 |
10 | 103022030230212 |
11 | 2a90a441316985 |
12 | b67a439589370 |
13 | 4563c21b50812 |
14 | 1b624158b8352 |
15 | bd9c8d11420c |
hex | 5db2af8412c4 |
103022030230212 has 24 divisors (see below), whose sum is σ = 243427581980800. Its totient is φ = 33905984632416.
The previous prime is 103022030230193. The next prime is 103022030230213. The reversal of 103022030230212 is 212032030220301.
It is a happy number.
It is a super-2 number, since 2×1030220302302122 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103022030230213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 54336512887 + ... + 54336514782.
Almost surely, 2103022030230212 is an apocalyptic number.
103022030230212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
103022030230212 is an abundant number, since it is smaller than the sum of its proper divisors (140405551750588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103022030230212 is a wasteful number, since it uses less digits than its factorization.
103022030230212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 108673027755 (or 108673027753 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 103022030230212 its reverse (212032030220301), we get a palindrome (315054060450513).
The spelling of 103022030230212 in words is "one hundred three trillion, twenty-two billion, thirty million, two hundred thirty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •