Base | Representation |
---|---|
bin | 11101011110111001011… |
… | …00101101000111010000 |
3 | 10120211210002220000212110 |
4 | 32233130230231013100 |
5 | 113044131111134300 |
6 | 2053212554425320 |
7 | 133121403051345 |
oct | 16573454550720 |
9 | 3524702800773 |
10 | 1013020021200 |
11 | 36068a4355a0 |
12 | 1443b6432240 |
13 | 746b185a4b5 |
14 | 3705d7047cc |
15 | 1b53e820550 |
hex | ebdcb2d1d0 |
1013020021200 has 960 divisors, whose sum is σ = 3738750418944. Its totient is φ = 232243200000.
The previous prime is 1013020021193. The next prime is 1013020021219. The reversal of 1013020021200 is 21200203101.
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 polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 5248808304 + ... + 5248808496.
Almost surely, 21013020021200 is an apocalyptic number.
1013020021200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1013020021200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1869375209472).
1013020021200 is an abundant number, since it is smaller than the sum of its proper divisors (2725730397744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1013020021200 is a wasteful number, since it uses less digits than its factorization.
1013020021200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 484 (or 473 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 1013020021200 its reverse (21200203101), we get a palindrome (1034220224301).
The spelling of 1013020021200 in words is "one trillion, thirteen billion, twenty million, twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •