Base | Representation |
---|---|
bin | 1010111010100100000010… |
… | …1000100111001010010100 |
3 | 1120111022020212101121020200 |
4 | 2232221000220213022110 |
5 | 3033112001042404022 |
6 | 41305141415300500 |
7 | 2346026331316062 |
oct | 256510050471224 |
9 | 46438225347220 |
10 | 12001223013012 |
11 | 3907765579662 |
12 | 1419b0137a730 |
13 | 690930bb0a1c |
14 | 2d6c101bd032 |
15 | 15c2a54a4bac |
hex | aea40a27294 |
12001223013012 has 72 divisors (see below), whose sum is σ = 30367403853696. Its totient is φ = 3996324655104.
The previous prime is 12001223013007. The next prime is 12001223013041. The reversal of 12001223013012 is 21031032210021.
12001223013012 is a `hidden beast` number, since 1 + 200 + 122 + 301 + 30 + 12 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 141586708 + ... + 141671444.
It is an arithmetic number, because the mean of its divisors is an integer number (421769497968).
Almost surely, 212001223013012 is an apocalyptic number.
12001223013012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12001223013012 is an abundant number, since it is smaller than the sum of its proper divisors (18366180840684).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12001223013012 is a wasteful number, since it uses less digits than its factorization.
12001223013012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 88717 (or 88712 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 12001223013012 its reverse (21031032210021), we get a palindrome (33032255223033).
The spelling of 12001223013012 in words is "twelve trillion, one billion, two hundred twenty-three million, thirteen thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •