Base | Representation |
---|---|
bin | 11000011001111000… |
… | …01101000000100000 |
3 | 1020211002202002102110 |
4 | 30030330031000200 |
5 | 203313103313100 |
6 | 10004033315320 |
7 | 642452152023 |
oct | 141474150040 |
9 | 36732662373 |
10 | 13102010400 |
11 | 561381a376 |
12 | 2657a05b40 |
13 | 130a56a59b |
14 | 8c41211ba |
15 | 51a3a2250 |
hex | 30cf0d020 |
13102010400 has 144 divisors (see below), whose sum is σ = 43126927200. Its totient is φ = 3454556160.
The previous prime is 13102010377. The next prime is 13102010417. The reversal of 13102010400 is 401020131.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 182931 + ... + 244269.
It is an arithmetic number, because the mean of its divisors is an integer number (299492550).
Almost surely, 213102010400 is an apocalyptic number.
13102010400 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 13102010400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21563463600).
13102010400 is an abundant number, since it is smaller than the sum of its proper divisors (30024916800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13102010400 is a wasteful number, since it uses less digits than its factorization.
13102010400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61451 (or 61438 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 13102010400 its reverse (401020131), we get a palindrome (13503030531).
The spelling of 13102010400 in words is "thirteen billion, one hundred two million, ten thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •