Base | Representation |
---|---|
bin | 11110000010010000010… |
… | …11110101011100101101 |
3 | 10122122210002010002121222 |
4 | 33001020023311130231 |
5 | 113402020310304401 |
6 | 2110032402233125 |
7 | 134363000401220 |
oct | 17011013653455 |
9 | 3578702102558 |
10 | 1032003213101 |
11 | 368740a00643 |
12 | 1480139557a5 |
13 | 76418691623 |
14 | 37d409455b7 |
15 | 1bca1189c1b |
hex | f0482f572d |
1032003213101 has 16 divisors (see below), whose sum is σ = 1180102694400. Its totient is φ = 884071534848.
The previous prime is 1032003213067. The next prime is 1032003213107. The reversal of 1032003213101 is 1013123002301.
1032003213101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 1032003213101 - 214 = 1032003196717 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1032003213101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1032003213107) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 186988220 + ... + 186993738.
It is an arithmetic number, because the mean of its divisors is an integer number (73756418400).
Almost surely, 21032003213101 is an apocalyptic number.
It is an amenable number.
1032003213101 is a deficient number, since it is larger than the sum of its proper divisors (148099481299).
1032003213101 is an equidigital number, since it uses as much as digits as its factorization.
1032003213101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15868.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1032003213101 its reverse (1013123002301), we get a palindrome (2045126215402).
The spelling of 1032003213101 in words is "one trillion, thirty-two billion, three million, two hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •