Base | Representation |
---|---|
bin | 1011110110011101010110… |
… | …1000101110010101000100 |
3 | 1201010200021102211011212000 |
4 | 2331213111220232111010 |
5 | 3201441342312000200 |
6 | 43414000032425300 |
7 | 2513254666544043 |
oct | 275472550562504 |
9 | 51120242734760 |
10 | 13030220031300 |
11 | 41740a356857a |
12 | 15654163a8230 |
13 | 73698a7cc244 |
14 | 33094778855a |
15 | 178e2c775300 |
hex | bd9d5a2e544 |
13030220031300 has 72 divisors (see below), whose sum is σ = 41889744405600. Its totient is φ = 3474725340960.
The previous prime is 13030220031259. The next prime is 13030220031313. The reversal of 13030220031300 is 313002203031.
13030220031300 is a `hidden beast` number, since 1 + 30 + 302 + 2 + 0 + 0 + 31 + 300 = 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 pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2413001010 + ... + 2413006409.
Almost surely, 213030220031300 is an apocalyptic number.
13030220031300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13030220031300 is an abundant number, since it is smaller than the sum of its proper divisors (28859524374300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13030220031300 is a wasteful number, since it uses less digits than its factorization.
13030220031300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4826007442 (or 4826007429 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 13030220031300 its reverse (313002203031), we get a palindrome (13343222234331).
The spelling of 13030220031300 in words is "thirteen trillion, thirty billion, two hundred twenty million, thirty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •