Base | Representation |
---|---|
bin | 11101011101011001000… |
… | …11100010101110101010 |
3 | 10120202200211001012112000 |
4 | 32232230203202232222 |
5 | 113041002323004002 |
6 | 2053000502431430 |
7 | 133062364462062 |
oct | 16565443425652 |
9 | 3522624035460 |
10 | 1012212313002 |
11 | 36030550a460 |
12 | 14420ba32576 |
13 | 745b3408c57 |
14 | 36dc43303a2 |
15 | 1b4e397461c |
hex | ebac8e2baa |
1012212313002 has 128 divisors (see below), whose sum is σ = 2463233310720. Its totient is φ = 305559630720.
The previous prime is 1012212312973. The next prime is 1012212313043. The reversal of 1012212313002 is 2003132122101.
1012212313002 is a `hidden beast` number, since 10 + 122 + 1 + 231 + 300 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 342772758 + ... + 342775710.
It is an arithmetic number, because the mean of its divisors is an integer number (19244010240).
Almost surely, 21012212313002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1012212313002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1231616655360).
1012212313002 is an abundant number, since it is smaller than the sum of its proper divisors (1451020997718).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012212313002 is a wasteful number, since it uses less digits than its factorization.
1012212313002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4985 (or 4979 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 1012212313002 its reverse (2003132122101), we get a palindrome (3015344435103).
The spelling of 1012212313002 in words is "one trillion, twelve billion, two hundred twelve million, three hundred thirteen thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •