Base | Representation |
---|---|
bin | 1001001000100101001000… |
… | …0100000101010100110111 |
3 | 1022120002202122202220200112 |
4 | 2102021102010011110313 |
5 | 2304021041121341101 |
6 | 33205410101533235 |
7 | 2054404105245065 |
oct | 222112204052467 |
9 | 38502678686615 |
10 | 10043010340151 |
11 | 3222242575188 |
12 | 116249ba1421b |
13 | 57b089aa2939 |
14 | 26a127435035 |
15 | 126395d626bb |
hex | 92252105537 |
10043010340151 has 8 divisors (see below), whose sum is σ = 10311831811008. Its totient is φ = 9775325536000.
The previous prime is 10043010340123. The next prime is 10043010340157. The reversal of 10043010340151 is 15104301034001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10043010340151 - 26 = 10043010340087 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10043010340157) 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 in 7 ways as a sum of consecutive naturals, for example, 284148770 + ... + 284184111.
It is an arithmetic number, because the mean of its divisors is an integer number (1288978976376).
Almost surely, 210043010340151 is an apocalyptic number.
10043010340151 is a deficient number, since it is larger than the sum of its proper divisors (268821470857).
10043010340151 is an equidigital number, since it uses as much as digits as its factorization.
10043010340151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 568333353.
The product of its (nonzero) digits is 720, while the sum is 23.
Adding to 10043010340151 its reverse (15104301034001), we get a palindrome (25147311374152).
The spelling of 10043010340151 in words is "ten trillion, forty-three billion, ten million, three hundred forty thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •