Base | Representation |
---|---|
bin | 10001011111011110100… |
… | …101001000110110100000 |
3 | 11020220122112210120111202 |
4 | 101133132211020312200 |
5 | 124143224204344440 |
6 | 2320112141500332 |
7 | 152562266501546 |
oct | 21373645106640 |
9 | 4226575716452 |
10 | 1202030153120 |
11 | 423861759195 |
12 | 174b655716a8 |
13 | 8947408b944 |
14 | 4226ddd1d96 |
15 | 21403057615 |
hex | 117de948da0 |
1202030153120 has 48 divisors (see below), whose sum is σ = 2840124423528. Its totient is φ = 480756495360.
The previous prime is 1202030153089. The next prime is 1202030153141. The reversal of 1202030153120 is 213510302021.
It can be written as a sum of positive squares in 4 ways, for example, as 1055148057616 + 146882095504 = 1027204^2 + 383252^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 1202030153092 and 1202030153101.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 968822 + ... + 1828298.
Almost surely, 21202030153120 is an apocalyptic number.
1202030153120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1202030153120 is an abundant number, since it is smaller than the sum of its proper divisors (1638094270408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1202030153120 is an equidigital number, since it uses as much as digits as its factorization.
1202030153120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 868233 (or 868225 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 20.
Adding to 1202030153120 its reverse (213510302021), we get a palindrome (1415540455141).
The spelling of 1202030153120 in words is "one trillion, two hundred two billion, thirty million, one hundred fifty-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •