Base | Representation |
---|---|
bin | 11101011101000000010… |
… | …00111001011000010100 |
3 | 10120202011022001212120210 |
4 | 32232200020321120110 |
5 | 113040041011020200 |
6 | 2052524101525420 |
7 | 133054255036245 |
oct | 16564010713024 |
9 | 3522138055523 |
10 | 1012004001300 |
11 | 36020896a826 |
12 | 144172113870 |
13 | 7457c2016a6 |
14 | 36da47c6ccc |
15 | 1b4d0527650 |
hex | eba0239614 |
1012004001300 has 72 divisors (see below), whose sum is σ = 3029032692000. Its totient is φ = 260561947520.
The previous prime is 1012004001299. The next prime is 1012004001317. The reversal of 1012004001300 is 31004002101.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 58152450 + ... + 58169849.
It is an arithmetic number, because the mean of its divisors is an integer number (42069898500).
Almost surely, 21012004001300 is an apocalyptic number.
1012004001300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1012004001300 is an abundant number, since it is smaller than the sum of its proper divisors (2017028690700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012004001300 is a wasteful number, since it uses less digits than its factorization.
1012004001300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116322345 (or 116322338 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 1012004001300 its reverse (31004002101), we get a palindrome (1043008003401).
The spelling of 1012004001300 in words is "one trillion, twelve billion, four million, one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •