Base | Representation |
---|---|
bin | 1000001001111010110… |
… | …0011101110110100100 |
3 | 111101121220112001101222 |
4 | 2002132230131312210 |
5 | 4243411430111322 |
6 | 144210043235512 |
7 | 13056562223621 |
oct | 2023654356644 |
9 | 441556461358 |
10 | 140101410212 |
11 | 54464659135 |
12 | 2319b818b98 |
13 | 102998aa63a |
14 | 6ad0ca9348 |
15 | 399eaa3e42 |
hex | 209eb1dda4 |
140101410212 has 12 divisors (see below), whose sum is σ = 245215343436. Its totient is φ = 70039883520.
The previous prime is 140101410209. The next prime is 140101410217. The reversal of 140101410212 is 212014101041.
140101410212 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 116461117696 + 23640292516 = 341264^2 + 153754^2 .
It is not an unprimeable number, because it can be changed into a prime (140101410217) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 2676233 + ... + 2728080.
It is an arithmetic number, because the mean of its divisors is an integer number (20434611953).
Almost surely, 2140101410212 is an apocalyptic number.
It is an amenable number.
140101410212 is a deficient number, since it is larger than the sum of its proper divisors (105113933224).
140101410212 is a wasteful number, since it uses less digits than its factorization.
140101410212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5410798 (or 5410796 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 140101410212 its reverse (212014101041), we get a palindrome (352115511253).
The spelling of 140101410212 in words is "one hundred forty billion, one hundred one million, four hundred ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •