Base | Representation |
---|---|
bin | 1000100011101010000… |
… | …1010100011101010010 |
3 | 112001110102120101201220 |
4 | 2020322201110131102 |
5 | 4402034214414023 |
6 | 151311421305510 |
7 | 13423030225140 |
oct | 2107241243522 |
9 | 461412511656 |
10 | 147010701138 |
11 | 5738a787724 |
12 | 245a9705296 |
13 | 10b2b173972 |
14 | 7188772590 |
15 | 3c564513e3 |
hex | 223a854752 |
147010701138 has 32 divisors (see below), whose sum is σ = 347611512960. Its totient is φ = 40554675840.
The previous prime is 147010701113. The next prime is 147010701139. The reversal of 147010701138 is 831107010741.
It is a super-2 number, since 2×1470107011382 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 147010701099 and 147010701108.
It is not an unprimeable number, because it can be changed into a prime (147010701139) 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, 60348003 + ... + 60350438.
It is an arithmetic number, because the mean of its divisors is an integer number (10862859780).
Almost surely, 2147010701138 is an apocalyptic number.
147010701138 is an abundant number, since it is smaller than the sum of its proper divisors (200600811822).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
147010701138 is a wasteful number, since it uses less digits than its factorization.
147010701138 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 120698482.
The product of its (nonzero) digits is 4704, while the sum is 33.
Adding to 147010701138 its reverse (831107010741), we get a palindrome (978117711879).
The spelling of 147010701138 in words is "one hundred forty-seven billion, ten million, seven hundred one thousand, one hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •