Base | Representation |
---|---|
bin | 10111001100100000000100… |
… | …001010101000010101110010 |
3 | 111101012110022100002202121010 |
4 | 113030200010022220111302 |
5 | 101332344421034011010 |
6 | 1000544351253211350 |
7 | 30326164214122113 |
oct | 2714400412502562 |
9 | 441173270082533 |
10 | 102014133110130 |
11 | 2a560a5070186a |
12 | b537032930b56 |
13 | 44bcb78753477 |
14 | 1b2972070820a |
15 | bbd94d425620 |
hex | 5cc8042a8572 |
102014133110130 has 32 divisors (see below), whose sum is σ = 244834738646400. Its totient is φ = 27203677809152.
The previous prime is 102014133110107. The next prime is 102014133110209. The reversal of 102014133110130 is 31011331410201.
It is a super-2 number, since 2×1020141331101302 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102014133110097 and 102014133110106.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3679891 + ... + 14750249.
It is an arithmetic number, because the mean of its divisors is an integer number (7651085582700).
Almost surely, 2102014133110130 is an apocalyptic number.
102014133110130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102014133110130 is an abundant number, since it is smaller than the sum of its proper divisors (142820605536270).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102014133110130 is a wasteful number, since it uses less digits than its factorization.
102014133110130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11377538.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 102014133110130 its reverse (31011331410201), we get a palindrome (133025464520331).
The spelling of 102014133110130 in words is "one hundred two trillion, fourteen billion, one hundred thirty-three million, one hundred ten thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •