Base | Representation |
---|---|
bin | 1100101001000110110101… |
… | …0111000010100011000110 |
3 | 1211012212020012211220012120 |
4 | 3022101231113002203012 |
5 | 3310220403311114100 |
6 | 45321422050430410 |
7 | 2633160414244341 |
oct | 312215527024306 |
9 | 54185205756176 |
10 | 13900348926150 |
11 | 447a117650a05 |
12 | 1685b92892406 |
13 | 79aa498129ab |
14 | 360acd8b9458 |
15 | 1918a76390a0 |
hex | ca46d5c28c6 |
13900348926150 has 24 divisors (see below), whose sum is σ = 34472865337224. Its totient is φ = 3706759713600.
The previous prime is 13900348926131. The next prime is 13900348926161. The reversal of 13900348926150 is 5162984300931.
It is a junction number, because it is equal to n+sod(n) for n = 13900348926093 and 13900348926102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 46334496271 + ... + 46334496570.
It is an arithmetic number, because the mean of its divisors is an integer number (1436369389051).
Almost surely, 213900348926150 is an apocalyptic number.
13900348926150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13900348926150 is an abundant number, since it is smaller than the sum of its proper divisors (20572516411074).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13900348926150 is a wasteful number, since it uses less digits than its factorization.
13900348926150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 92668992856 (or 92668992851 counting only the distinct ones).
The product of its (nonzero) digits is 1399680, while the sum is 51.
The spelling of 13900348926150 in words is "thirteen trillion, nine hundred billion, three hundred forty-eight million, nine hundred twenty-six thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •