Base | Representation |
---|---|
bin | 11100110011000011010100… |
… | …001101110100010001111101 |
3 | 121121102221222002021011012102 |
4 | 130303003110031310101331 |
5 | 113100042440320010003 |
6 | 1125211501305314445 |
7 | 35451263121161420 |
oct | 3463032415642175 |
9 | 547387862234172 |
10 | 126653556016253 |
11 | 373a0520579912 |
12 | 12256383795a25 |
13 | 55894c0b06bc6 |
14 | 233c0c9c139b7 |
15 | e9983a0c5588 |
hex | 7330d437447d |
126653556016253 has 8 divisors (see below), whose sum is σ = 144746989539072. Its totient is φ = 108560139587856.
The previous prime is 126653556016243. The next prime is 126653556016261. The reversal of 126653556016253 is 352610655356621.
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 126653556016253 - 226 = 126653488907389 is a prime.
It is a super-2 number, since 2×1266535560162532 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126653556016243) 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, 24683276 + ... + 29369562.
It is an arithmetic number, because the mean of its divisors is an integer number (18093373692384).
Almost surely, 2126653556016253 is an apocalyptic number.
It is an amenable number.
126653556016253 is a deficient number, since it is larger than the sum of its proper divisors (18093433522819).
126653556016253 is an equidigital number, since it uses as much as digits as its factorization.
126653556016253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8547211.
The product of its (nonzero) digits is 29160000, while the sum is 56.
The spelling of 126653556016253 in words is "one hundred twenty-six trillion, six hundred fifty-three billion, five hundred fifty-six million, sixteen thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •