Base | Representation |
---|---|
bin | 11101111110111101001… |
… | …11111101001110111011 |
3 | 10122111012122122022112201 |
4 | 32333132213331032323 |
5 | 113334403420400443 |
6 | 2105140535251031 |
7 | 134301054133120 |
oct | 16773647751673 |
9 | 3574178568481 |
10 | 1030232200123 |
11 | 367a12245355 |
12 | 1477ba819a77 |
13 | 761c57b0459 |
14 | 37c13656747 |
15 | 1bbea95a34d |
hex | efde9fd3bb |
1030232200123 has 8 divisors (see below), whose sum is σ = 1179347950592. Its totient is φ = 881601380136.
The previous prime is 1030232200111. The next prime is 1030232200187. The reversal of 1030232200123 is 3210022320301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1030232200123 is a prime.
It is a super-2 number, since 2×10302322001232 (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 1030232200123.
It is not an unprimeable number, because it can be changed into a prime (1030232200523) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 121228065 + ... + 121236562.
It is an arithmetic number, because the mean of its divisors is an integer number (147418493824).
Almost surely, 21030232200123 is an apocalyptic number.
1030232200123 is a deficient number, since it is larger than the sum of its proper divisors (149115750469).
1030232200123 is an equidigital number, since it uses as much as digits as its factorization.
1030232200123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 242465241.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 1030232200123 its reverse (3210022320301), we get a palindrome (4240254520424).
The spelling of 1030232200123 in words is "one trillion, thirty billion, two hundred thirty-two million, two hundred thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •