Base | Representation |
---|---|
bin | 1000001001111111001… |
… | …1011000111001000011 |
3 | 111101200012111121200222 |
4 | 2002133303120321003 |
5 | 4243431210031430 |
6 | 144211545533255 |
7 | 13060206236462 |
oct | 2023763307103 |
9 | 441605447628 |
10 | 140120002115 |
11 | 544740a7545 |
12 | 231a5aa422b |
13 | 102a06b9b72 |
14 | 6ad35489d9 |
15 | 39a15279e5 |
hex | 209fcd8e43 |
140120002115 has 32 divisors (see below), whose sum is σ = 178914548736. Its totient is φ = 105119372160.
The previous prime is 140120002109. The next prime is 140120002133. The reversal of 140120002115 is 511200021041.
140120002115 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-140120002115 is a prime.
It is a super-2 number, since 2×1401200021152 (a number of 23 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 = 140120002093 and 140120002102.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2121074 + ... + 2186136.
It is an arithmetic number, because the mean of its divisors is an integer number (5591079648).
Almost surely, 2140120002115 is an apocalyptic number.
140120002115 is a deficient number, since it is larger than the sum of its proper divisors (38794546621).
140120002115 is a wasteful number, since it uses less digits than its factorization.
140120002115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65459.
The product of its (nonzero) digits is 80, while the sum is 17.
Adding to 140120002115 its reverse (511200021041), we get a palindrome (651320023156).
The spelling of 140120002115 in words is "one hundred forty billion, one hundred twenty million, two thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •