Base | Representation |
---|---|
bin | 10100101111010000000… |
… | …101010110110100101001 |
3 | 12001020111102120020102012 |
4 | 110233100011112310221 |
5 | 141322124030140410 |
6 | 3010405443445305 |
7 | 204650634445640 |
oct | 24572005266451 |
9 | 5036442506365 |
10 | 1425125240105 |
11 | 4aa435055036 |
12 | 1b0247686835 |
13 | a4509080458 |
14 | 4cd95474357 |
15 | 2710dd20605 |
hex | 14bd0156d29 |
1425125240105 has 8 divisors (see below), whose sum is σ = 1954457472192. Its totient is φ = 977228736048.
The previous prime is 1425125240003. The next prime is 1425125240107. The reversal of 1425125240105 is 5010425215241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1425125240105 - 228 = 1424856804649 is a prime.
It is a super-2 number, since 2×14251252401052 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1425125240107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20358931967 + ... + 20358932036.
It is an arithmetic number, because the mean of its divisors is an integer number (244307184024).
Almost surely, 21425125240105 is an apocalyptic number.
It is an amenable number.
1425125240105 is a deficient number, since it is larger than the sum of its proper divisors (529332232087).
1425125240105 is an equidigital number, since it uses as much as digits as its factorization.
1425125240105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40717864015.
The product of its (nonzero) digits is 16000, while the sum is 32.
The spelling of 1425125240105 in words is "one trillion, four hundred twenty-five billion, one hundred twenty-five million, two hundred forty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.789 sec. • engine limits •