Base | Representation |
---|---|
bin | 10011010000001001101… |
… | …110001110011111100100 |
3 | 11200110221001110000110200 |
4 | 103100021232032133210 |
5 | 133134012314240400 |
6 | 2451441144550500 |
7 | 164404332201633 |
oct | 23201156163744 |
9 | 4613831400420 |
10 | 1323013040100 |
11 | 4700a54088a4 |
12 | 1944aa482430 |
13 | 979b4aa0b2b |
14 | 48069aad51a |
15 | 2463445db00 |
hex | 13409b8e7e4 |
1323013040100 has 54 divisors (see below), whose sum is σ = 4146910876290. Its totient is φ = 352803477120.
The previous prime is 1323013040081. The next prime is 1323013040159. The reversal of 1323013040100 is 10403103231.
1323013040100 is a `hidden beast` number, since 1 + 3 + 230 + 1 + 30 + 401 + 0 + 0 = 666.
It can be written as a sum of positive squares in 3 ways, for example, as 128858025024 + 1194155015076 = 358968^2 + 1092774^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 735006345 + ... + 735008144.
Almost surely, 21323013040100 is an apocalyptic number.
1323013040100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1323013040100 is an abundant number, since it is smaller than the sum of its proper divisors (2823897836190).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1323013040100 is a wasteful number, since it uses less digits than its factorization.
1323013040100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1470014509 (or 1470014499 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 1323013040100 its reverse (10403103231), we get a palindrome (1333416143331).
The spelling of 1323013040100 in words is "one trillion, three hundred twenty-three billion, thirteen million, forty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •