Base | Representation |
---|---|
bin | 11100100001100011100010… |
… | …011111011010001111111001 |
3 | 121110012000111011002002112221 |
4 | 130201203202133122033321 |
5 | 112420343031343310421 |
6 | 1122451253211204041 |
7 | 35265356541265030 |
oct | 3441434237321771 |
9 | 543160434062487 |
10 | 125451204666361 |
11 | 36a77614589852 |
12 | 120a134a746621 |
13 | 54cccc8338402 |
14 | 22d9c292d1717 |
15 | e78418c73841 |
hex | 7218e27da3f9 |
125451204666361 has 32 divisors (see below), whose sum is σ = 153421565536512. Its totient is φ = 100128303636480.
The previous prime is 125451204666349. The next prime is 125451204666373. The reversal of 125451204666361 is 163666402154521.
It is an interprime number because it is at equal distance from previous prime (125451204666349) and next prime (125451204666373).
It is a de Polignac number, because none of the positive numbers 2k-125451204666361 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 125451204666299 and 125451204666308.
It is not an unprimeable number, because it can be changed into a prime (125451204666461) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 33630591 + ... + 37174171.
It is an arithmetic number, because the mean of its divisors is an integer number (4794423923016).
Almost surely, 2125451204666361 is an apocalyptic number.
It is an amenable number.
125451204666361 is a deficient number, since it is larger than the sum of its proper divisors (27970360870151).
125451204666361 is a wasteful number, since it uses less digits than its factorization.
125451204666361 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3546769.
The product of its (nonzero) digits is 6220800, while the sum is 52.
The spelling of 125451204666361 in words is "one hundred twenty-five trillion, four hundred fifty-one billion, two hundred four million, six hundred sixty-six thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •