Base | Representation |
---|---|
bin | 10001111001100111111… |
… | …110010001101011100101 |
3 | 11100121010010121211220202 |
4 | 101321213332101223211 |
5 | 130123223341302003 |
6 | 2341034043440245 |
7 | 154605102123656 |
oct | 21714776215345 |
9 | 4317103554822 |
10 | 1230105025253 |
11 | 434759244155 |
12 | 17a49b826085 |
13 | 8bcc9662a10 |
14 | 437748b152d |
15 | 21ee7b5d088 |
hex | 11e67f91ae5 |
1230105025253 has 4 divisors (see below), whose sum is σ = 1324728488748. Its totient is φ = 1135481561760.
The previous prime is 1230105025213. The next prime is 1230105025267. The reversal of 1230105025253 is 3525205010321.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 505262229124 + 724842796129 = 710818^2 + 851377^2 .
It is not a de Polignac number, because 1230105025253 - 28 = 1230105024997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1230105025213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 47311731728 + ... + 47311731753.
It is an arithmetic number, because the mean of its divisors is an integer number (331182122187).
Almost surely, 21230105025253 is an apocalyptic number.
1230105025253 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1230105025253 is a deficient number, since it is larger than the sum of its proper divisors (94623463495).
1230105025253 is an equidigital number, since it uses as much as digits as its factorization.
1230105025253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 94623463494.
The product of its (nonzero) digits is 9000, while the sum is 29.
The spelling of 1230105025253 in words is "one trillion, two hundred thirty billion, one hundred five million, twenty-five thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •