Base | Representation |
---|---|
bin | 1001010011000101111111… |
… | …1101100101101101100011 |
3 | 1100012100222111120022011201 |
4 | 2110301133331211231203 |
5 | 2320000444312122001 |
6 | 33424401034022031 |
7 | 2103430064252050 |
oct | 224613775455543 |
9 | 40170874508151 |
10 | 10223632145251 |
11 | 32918aa8a8778 |
12 | 11914a9877917 |
13 | 5921134a89a5 |
14 | 274b7da52027 |
15 | 12ae17e44501 |
hex | 94c5ff65b63 |
10223632145251 has 8 divisors (see below), whose sum is σ = 11797589383424. Its totient is φ = 8678034497160.
The previous prime is 10223632145173. The next prime is 10223632145267. The reversal of 10223632145251 is 15254123632201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10223632145251 - 241 = 8024608889699 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 10223632145251.
It is not an unprimeable number, because it can be changed into a prime (10223632145351) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7089896745 + ... + 7089898186.
It is an arithmetic number, because the mean of its divisors is an integer number (1474698672928).
Almost surely, 210223632145251 is an apocalyptic number.
10223632145251 is a deficient number, since it is larger than the sum of its proper divisors (1573957238173).
10223632145251 is a wasteful number, since it uses less digits than its factorization.
10223632145251 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14179795041.
The product of its (nonzero) digits is 86400, while the sum is 37.
Adding to 10223632145251 its reverse (15254123632201), we get a palindrome (25477755777452).
The spelling of 10223632145251 in words is "ten trillion, two hundred twenty-three billion, six hundred thirty-two million, one hundred forty-five thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •