Base | Representation |
---|---|
bin | 10011000001100010… |
… | …00010001011010100 |
3 | 222100210022112200020 |
4 | 21200301002023110 |
5 | 131404112320200 |
6 | 4405244345140 |
7 | 511045323114 |
oct | 114061021324 |
9 | 28323275606 |
10 | 10213401300 |
11 | 4371220623 |
12 | 1b905451b0 |
13 | c69c8752b |
14 | 6cc633044 |
15 | 3eb9b2ea0 |
hex | 260c422d4 |
10213401300 has 36 divisors (see below), whose sum is σ = 29550775296. Its totient is φ = 2723573600.
The previous prime is 10213401299. The next prime is 10213401307. The reversal of 10213401300 is 310431201.
It is a super-2 number, since 2×102134013002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 10213401300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10213401307) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 17022036 + ... + 17022635.
Almost surely, 210213401300 is an apocalyptic number.
10213401300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10213401300 is an abundant number, since it is smaller than the sum of its proper divisors (19337373996).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10213401300 is a wasteful number, since it uses less digits than its factorization.
10213401300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34044688 (or 34044681 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 10213401300 its reverse (310431201), we get a palindrome (10523832501).
The spelling of 10213401300 in words is "ten billion, two hundred thirteen million, four hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •