Base | Representation |
---|---|
bin | 11101111110100001110… |
… | …10101010000001001100 |
3 | 10122110121121220011200022 |
4 | 32333100322222001030 |
5 | 113333421032034012 |
6 | 2105102042121312 |
7 | 134262262265333 |
oct | 16772072520114 |
9 | 3573547804608 |
10 | 1030002221132 |
11 | 367904446775 |
12 | 1477557b0238 |
13 | 76189c5a901 |
14 | 37bd0cacd1a |
15 | 1bbd567d472 |
hex | efd0eaa04c |
1030002221132 has 6 divisors (see below), whose sum is σ = 1802503886988. Its totient is φ = 515001110564.
The previous prime is 1030002221119. The next prime is 1030002221137. The reversal of 1030002221132 is 2311222000301.
1030002221132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×10300022211322 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1030002221132.
It is not an unprimeable number, because it can be changed into a prime (1030002221137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 128750277638 + ... + 128750277645.
It is an arithmetic number, because the mean of its divisors is an integer number (300417314498).
Almost surely, 21030002221132 is an apocalyptic number.
It is an amenable number.
1030002221132 is a deficient number, since it is larger than the sum of its proper divisors (772501665856).
1030002221132 is a wasteful number, since it uses less digits than its factorization.
1030002221132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 257500555287 (or 257500555285 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 1030002221132 its reverse (2311222000301), we get a palindrome (3341224221433).
The spelling of 1030002221132 in words is "one trillion, thirty billion, two million, two hundred twenty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •