Base | Representation |
---|---|
bin | 1101011001001100001… |
… | …0101100000000111100 |
3 | 210222221002011101121220 |
4 | 3112103002230000330 |
5 | 12232221124101022 |
6 | 253412342153340 |
7 | 22424045421213 |
oct | 3262302540074 |
9 | 728832141556 |
10 | 230100222012 |
11 | 89648638541 |
12 | 38718122850 |
13 | 189103a4b2b |
14 | b1cb97807a |
15 | 5ebac9885c |
hex | 35930ac03c |
230100222012 has 24 divisors (see below), whose sum is σ = 537235916112. Its totient is φ = 76652160000.
The previous prime is 230100221983. The next prime is 230100222041. The reversal of 230100222012 is 210222001032.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (230100221983) and next prime (230100222041).
It is a super-2 number, since 2×2301002220122 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 230100221982 and 230100222000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5969239 + ... + 6007662.
It is an arithmetic number, because the mean of its divisors is an integer number (22384829838).
Almost surely, 2230100222012 is an apocalyptic number.
It is an amenable number.
230100222012 is an abundant number, since it is smaller than the sum of its proper divisors (307135694100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230100222012 is a wasteful number, since it uses less digits than its factorization.
230100222012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11978509 (or 11978507 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 230100222012 its reverse (210222001032), we get a palindrome (440322223044).
The spelling of 230100222012 in words is "two hundred thirty billion, one hundred million, two hundred twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •