Base | Representation |
---|---|
bin | 11001001001000010… |
… | …10101101010000011 |
3 | 1021211200011012022110 |
4 | 30210201111222003 |
5 | 210120342333443 |
6 | 10111204510403 |
7 | 655324613040 |
oct | 144441255203 |
9 | 37750135273 |
10 | 13497621123 |
11 | 57a7067588 |
12 | 27483ab403 |
13 | 137150307c |
14 | 9208a21c7 |
15 | 53ee9a233 |
hex | 324855a83 |
13497621123 has 32 divisors (see below), whose sum is σ = 21248151552. Its totient is φ = 7458192000.
The previous prime is 13497621107. The next prime is 13497621191. The reversal of 13497621123 is 32112679431.
It is not a de Polignac number, because 13497621123 - 24 = 13497621107 is a prime.
It is a super-2 number, since 2×134976211232 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13497621023) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 886273 + ... + 901373.
It is an arithmetic number, because the mean of its divisors is an integer number (664004736).
Almost surely, 213497621123 is an apocalyptic number.
13497621123 is a deficient number, since it is larger than the sum of its proper divisors (7750530429).
13497621123 is a wasteful number, since it uses less digits than its factorization.
13497621123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16515.
The product of its digits is 54432, while the sum is 39.
The spelling of 13497621123 in words is "thirteen billion, four hundred ninety-seven million, six hundred twenty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •