Base | Representation |
---|---|
bin | 1001001110010010111101… |
… | …1110100011011000011011 |
3 | 1022220111020122220012021211 |
4 | 2103210233132203120123 |
5 | 2312123201331334001 |
6 | 33322450510043551 |
7 | 2064451513321453 |
oct | 223445736433033 |
9 | 38814218805254 |
10 | 10141214324251 |
11 | 325a957117a1a |
12 | 11795281a95b7 |
13 | 58740a48887a |
14 | 270ba1b38d63 |
15 | 128be257e351 |
hex | 9392f7a361b |
10141214324251 has 4 divisors (see below), whose sum is σ = 10674962446600. Its totient is φ = 9607466201904.
The previous prime is 10141214324231. The next prime is 10141214324287. The reversal of 10141214324251 is 15242341214101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10141214324251 - 27 = 10141214324123 is a prime.
It is a super-2 number, since 2×101412143242512 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10141214324221) 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, 266874061146 + ... + 266874061183.
It is an arithmetic number, because the mean of its divisors is an integer number (2668740611650).
Almost surely, 210141214324251 is an apocalyptic number.
10141214324251 is a deficient number, since it is larger than the sum of its proper divisors (533748122349).
10141214324251 is an equidigital number, since it uses as much as digits as its factorization.
10141214324251 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 533748122348.
The product of its (nonzero) digits is 7680, while the sum is 31.
Adding to 10141214324251 its reverse (15242341214101), we get a palindrome (25383555538352).
The spelling of 10141214324251 in words is "ten trillion, one hundred forty-one billion, two hundred fourteen million, three hundred twenty-four thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •