Base | Representation |
---|---|
bin | 10111010011010011001101… |
… | …110011010001100100011111 |
3 | 111102212010100001100200000202 |
4 | 113103103031303101210133 |
5 | 101413023322322000101 |
6 | 1001543143110014115 |
7 | 30405014642035136 |
oct | 2723231563214437 |
9 | 442763301320022 |
10 | 102481372453151 |
11 | 2a72111907a83a |
12 | b5b16b034733b |
13 | 4524c4b5a56c3 |
14 | 1b441a69c091d |
15 | bcab97db736b |
hex | 5d34cdcd191f |
102481372453151 has 16 divisors (see below), whose sum is σ = 107027033516640. Its totient is φ = 98007142396800.
The previous prime is 102481372453051. The next prime is 102481372453171. The reversal of 102481372453151 is 151354273184201.
It is a cyclic number.
It is not a de Polignac number, because 102481372453151 - 210 = 102481372452127 is a prime.
It is a super-2 number, since 2×1024813724531512 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102481372453096 and 102481372453105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102481372453171) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 34059125 + ... + 36945726.
It is an arithmetic number, because the mean of its divisors is an integer number (6689189594790).
Almost surely, 2102481372453151 is an apocalyptic number.
102481372453151 is a deficient number, since it is larger than the sum of its proper divisors (4545661063489).
102481372453151 is a wasteful number, since it uses less digits than its factorization.
102481372453151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71005354.
The product of its (nonzero) digits is 806400, while the sum is 47.
The spelling of 102481372453151 in words is "one hundred two trillion, four hundred eighty-one billion, three hundred seventy-two million, four hundred fifty-three thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •