Base | Representation |
---|---|
bin | 1100101001000110110101… |
… | …0111000010100011000111 |
3 | 1211012212020012211220012121 |
4 | 3022101231113002203013 |
5 | 3310220403311114101 |
6 | 45321422050430411 |
7 | 2633160414244342 |
oct | 312215527024307 |
9 | 54185205756177 |
10 | 13900348926151 |
11 | 447a117650a06 |
12 | 1685b92892407 |
13 | 79aa498129ac |
14 | 360acd8b9459 |
15 | 1918a76390a1 |
hex | ca46d5c28c7 |
13900348926151 has 8 divisors (see below), whose sum is σ = 13938388044224. Its totient is φ = 13862310697440.
The previous prime is 13900348926131. The next prime is 13900348926161. The reversal of 13900348926151 is 15162984300931.
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 13900348926151 - 215 = 13900348893383 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 (13900348926131) 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, 42048061 + ... + 42377353.
It is an arithmetic number, because the mean of its divisors is an integer number (1742298505528).
Almost surely, 213900348926151 is an apocalyptic number.
13900348926151 is a deficient number, since it is larger than the sum of its proper divisors (38039118073).
13900348926151 is a wasteful number, since it uses less digits than its factorization.
13900348926151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 444681.
The product of its (nonzero) digits is 1399680, while the sum is 52.
The spelling of 13900348926151 in words is "thirteen trillion, nine hundred billion, three hundred forty-eight million, nine hundred twenty-six thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •