Base | Representation |
---|---|
bin | 1001001110011010100011… |
… | …1001011000111001101111 |
3 | 1022220200111122000111002212 |
4 | 2103212220321120321233 |
5 | 2312141334324333401 |
6 | 33323424555441035 |
7 | 2064553140231614 |
oct | 223465071307157 |
9 | 38820448014085 |
10 | 10143251402351 |
11 | 3260801a89941 |
12 | 11799b645617b |
13 | 587673515822 |
14 | 270d164c650b |
15 | 128cb1317dbb |
hex | 939a8e58e6f |
10143251402351 has 4 divisors (see below), whose sum is σ = 10584262332912. Its totient is φ = 9702240471792.
The previous prime is 10143251402299. The next prime is 10143251402399. The reversal of 10143251402351 is 15320415234101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10143251402351 is a prime.
It is a super-2 number, since 2×101432514023512 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10143251402551) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 220505465246 + ... + 220505465291.
It is an arithmetic number, because the mean of its divisors is an integer number (2646065583228).
Almost surely, 210143251402351 is an apocalyptic number.
10143251402351 is a deficient number, since it is larger than the sum of its proper divisors (441010930561).
10143251402351 is an equidigital number, since it uses as much as digits as its factorization.
10143251402351 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 441010930560.
The product of its (nonzero) digits is 14400, while the sum is 32.
Adding to 10143251402351 its reverse (15320415234101), we get a palindrome (25463666636452).
The spelling of 10143251402351 in words is "ten trillion, one hundred forty-three billion, two hundred fifty-one million, four hundred two thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •