Base | Representation |
---|---|
bin | 1001001110100011010101… |
… | …0101110110001010000011 |
3 | 1022220220120211202102000211 |
4 | 2103220311111312022003 |
5 | 2312211201031004301 |
6 | 33324454450454551 |
7 | 2064665421214006 |
oct | 223506525661203 |
9 | 38826524672024 |
10 | 10145607672451 |
11 | 32618010434a9 |
12 | 117a353594457 |
13 | 58795a72cca4 |
14 | 27109b40153d |
15 | 128d9d102051 |
hex | 93a35576283 |
10145607672451 has 2 divisors, whose sum is σ = 10145607672452. Its totient is φ = 10145607672450.
The previous prime is 10145607672377. The next prime is 10145607672461. The reversal of 10145607672451 is 15427670654101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10145607672451 - 29 = 10145607671939 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10145607672395 and 10145607672404.
It is not a weakly prime, because it can be changed into another prime (10145607672461) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5072803836225 + 5072803836226.
It is an arithmetic number, because the mean of its divisors is an integer number (5072803836226).
Almost surely, 210145607672451 is an apocalyptic number.
10145607672451 is a deficient number, since it is larger than the sum of its proper divisors (1).
10145607672451 is an equidigital number, since it uses as much as digits as its factorization.
10145607672451 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1411200, while the sum is 49.
The spelling of 10145607672451 in words is "ten trillion, one hundred forty-five billion, six hundred seven million, six hundred seventy-two thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •