Base | Representation |
---|---|
bin | 1010111010011111100110… |
… | …0110010000000111101100 |
3 | 1120111012011210210211121220 |
4 | 2232213321212100013230 |
5 | 3033102030442241022 |
6 | 41304423243023340 |
7 | 2345654650216434 |
oct | 256477146200754 |
9 | 46435153724556 |
10 | 12000031212012 |
11 | 3907203862958 |
12 | 141982a20ab50 |
13 | 6907a0cca42c |
14 | 2d6b39bc52c4 |
15 | 15c235a3885c |
hex | ae9f99901ec |
12000031212012 has 48 divisors (see below), whose sum is σ = 28303507921920. Its totient is φ = 3956783452992.
The previous prime is 12000031211989. The next prime is 12000031212077. The reversal of 12000031212012 is 21021213000021.
It is a junction number, because it is equal to n+sod(n) for n = 12000031211982 and 12000031212000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6763158 + ... + 8351069.
It is an arithmetic number, because the mean of its divisors is an integer number (589656415040).
Almost surely, 212000031212012 is an apocalyptic number.
12000031212012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12000031212012 is an abundant number, since it is smaller than the sum of its proper divisors (16303476709908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12000031212012 is a wasteful number, since it uses less digits than its factorization.
12000031212012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15114950 (or 15114948 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 12000031212012 its reverse (21021213000021), we get a palindrome (33021244212033).
The spelling of 12000031212012 in words is "twelve trillion, thirty-one million, two hundred twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •