Base | Representation |
---|---|
bin | 1010111100011010110010… |
… | …1110101011001111110100 |
3 | 1120121100112112001000211110 |
4 | 2233012230232223033310 |
5 | 3034122242414004022 |
6 | 41331532550035020 |
7 | 2351235316355163 |
oct | 257065456531764 |
9 | 46540475030743 |
10 | 12033101313012 |
11 | 391a233a9723a |
12 | 1424119348a70 |
13 | 69394144c530 |
14 | 2d8595c833da |
15 | 15d01de5200c |
hex | af1acbab3f4 |
12033101313012 has 24 divisors (see below), whose sum is σ = 30237023812576. Its totient is φ = 3702492711648.
The previous prime is 12033101312929. The next prime is 12033101313031. The reversal of 12033101313012 is 21031310133021.
It is a happy number.
It is a super-2 number, since 2×120331013130122 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12033101313012.
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, 38567632258 + ... + 38567632569.
Almost surely, 212033101313012 is an apocalyptic number.
12033101313012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12033101313012 is an abundant number, since it is smaller than the sum of its proper divisors (18203922499564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12033101313012 is a wasteful number, since it uses less digits than its factorization.
12033101313012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 77135264847 (or 77135264845 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 12033101313012 its reverse (21031310133021), we get a palindrome (33064411446033).
The spelling of 12033101313012 in words is "twelve trillion, thirty-three billion, one hundred one million, three hundred thirteen thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •