Base | Representation |
---|---|
bin | 10010110111000101… |
… | …01001010100111111 |
3 | 222010200101001200012 |
4 | 21123202221110333 |
5 | 131214142242143 |
6 | 4352433453435 |
7 | 505632253565 |
oct | 113342512477 |
9 | 28120331605 |
10 | 10125743423 |
11 | 43267999a4 |
12 | 1b6711127b |
13 | c54a75673 |
14 | 6c0b35a35 |
15 | 3e3e4a418 |
hex | 25b8a953f |
10125743423 has 4 divisors (see below), whose sum is σ = 10126029648. Its totient is φ = 10125457200.
The previous prime is 10125743413. The next prime is 10125743431. The reversal of 10125743423 is 32434752101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 32434752101 = 1321 ⋅24553181.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10125743423 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10125743423.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10125743413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 81086 + ... + 163787.
It is an arithmetic number, because the mean of its divisors is an integer number (2531507412).
Almost surely, 210125743423 is an apocalyptic number.
10125743423 is a deficient number, since it is larger than the sum of its proper divisors (286225).
10125743423 is an equidigital number, since it uses as much as digits as its factorization.
10125743423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 286224.
The product of its (nonzero) digits is 20160, while the sum is 32.
The spelling of 10125743423 in words is "ten billion, one hundred twenty-five million, seven hundred forty-three thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •