Base | Representation |
---|---|
bin | 1001001100101111000101… |
… | …1110100101100110000111 |
3 | 1022210221001020011222210211 |
4 | 2103023301132211212013 |
5 | 2311203300002422101 |
6 | 33302254311100251 |
7 | 2062512240246364 |
oct | 223136136454607 |
9 | 38727036158724 |
10 | 10114404342151 |
11 | 324a54962961a |
12 | 11742a5671687 |
13 | 584a26c78935 |
14 | 26d77b23b46b |
15 | 128173a30c51 |
hex | 932f17a5987 |
10114404342151 has 8 divisors (see below), whose sum is σ = 10714284151920. Its totient is φ = 9515070626688.
The previous prime is 10114404342143. The next prime is 10114404342173. The reversal of 10114404342151 is 15124340441101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10114404342151 - 23 = 10114404342143 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 (10114404345151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 136485436 + ... + 136559521.
It is an arithmetic number, because the mean of its divisors is an integer number (1339285518990).
Almost surely, 210114404342151 is an apocalyptic number.
10114404342151 is a deficient number, since it is larger than the sum of its proper divisors (599879809769).
10114404342151 is a wasteful number, since it uses less digits than its factorization.
10114404342151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 273047153.
The product of its (nonzero) digits is 7680, while the sum is 31.
Adding to 10114404342151 its reverse (15124340441101), we get a palindrome (25238744783252).
The spelling of 10114404342151 in words is "ten trillion, one hundred fourteen billion, four hundred four million, three hundred forty-two thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •