Base | Representation |
---|---|
bin | 111010011000010100… |
… | …0101111000011000011 |
3 | 102222121020211201121012 |
4 | 1310300220233003003 |
5 | 4023224212131134 |
6 | 133332202551135 |
7 | 12025533504155 |
oct | 1646050570303 |
9 | 388536751535 |
10 | 125370036419 |
11 | 49195131a51 |
12 | 2036a2084ab |
13 | ba8c8c6004 |
14 | 60d460cad5 |
15 | 33db6526ce |
hex | 1d30a2f0c3 |
125370036419 has 2 divisors, whose sum is σ = 125370036420. Its totient is φ = 125370036418.
The previous prime is 125370036383. The next prime is 125370036457. The reversal of 125370036419 is 914630073521.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 125370036419 - 28 = 125370036163 is a prime.
It is a super-2 number, since 2×1253700364192 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (125370036499) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 62685018209 + 62685018210.
It is an arithmetic number, because the mean of its divisors is an integer number (62685018210).
Almost surely, 2125370036419 is an apocalyptic number.
125370036419 is a deficient number, since it is larger than the sum of its proper divisors (1).
125370036419 is an equidigital number, since it uses as much as digits as its factorization.
125370036419 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 136080, while the sum is 41.
The spelling of 125370036419 in words is "one hundred twenty-five billion, three hundred seventy million, thirty-six thousand, four hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •