Base | Representation |
---|---|
bin | 1001001110100011010101… |
… | …0101110110001010001101 |
3 | 1022220220120211202102001012 |
4 | 2103220311111312022031 |
5 | 2312211201031004321 |
6 | 33324454450455005 |
7 | 2064665421214022 |
oct | 223506525661215 |
9 | 38826524672035 |
10 | 10145607672461 |
11 | 3261801043508 |
12 | 117a353594465 |
13 | 58795a72ccb1 |
14 | 27109b401549 |
15 | 128d9d10205b |
hex | 93a3557628d |
10145607672461 has 2 divisors, whose sum is σ = 10145607672462. Its totient is φ = 10145607672460.
The previous prime is 10145607672451. The next prime is 10145607672467. The reversal of 10145607672461 is 16427670654101.
10145607672461 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5981600124361 + 4164007548100 = 2445731^2 + 2040590^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10145607672461 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10145607672467) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5072803836230 + 5072803836231.
It is an arithmetic number, because the mean of its divisors is an integer number (5072803836231).
Almost surely, 210145607672461 is an apocalyptic number.
It is an amenable number.
10145607672461 is a deficient number, since it is larger than the sum of its proper divisors (1).
10145607672461 is an equidigital number, since it uses as much as digits as its factorization.
10145607672461 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1693440, while the sum is 50.
The spelling of 10145607672461 in words is "ten trillion, one hundred forty-five billion, six hundred seven million, six hundred seventy-two thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •