Base | Representation |
---|---|
bin | 1000001010101111111… |
… | …0011011000001010011 |
3 | 111102012102210000100210 |
4 | 2002223332123001103 |
5 | 4244341000033021 |
6 | 144244123015203 |
7 | 13065236125032 |
oct | 2025376330123 |
9 | 442172700323 |
10 | 140324221011 |
11 | 54569401197 |
12 | 2324236a503 |
13 | 10303ac0550 |
14 | 6b12708719 |
15 | 39b4416e76 |
hex | 20abf9b053 |
140324221011 has 32 divisors (see below), whose sum is σ = 206275652352. Its totient is φ = 84304805760.
The previous prime is 140324220859. The next prime is 140324221021. The reversal of 140324221011 is 110122423041.
140324221011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 140324221011 - 29 = 140324220499 is a prime.
It is a super-3 number, since 3×1403242210113 (a number of 34 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (140324221021) 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 31 ways as a sum of consecutive naturals, for example, 3692296 + ... + 3730106.
It is an arithmetic number, because the mean of its divisors is an integer number (6446114136).
Almost surely, 2140324221011 is an apocalyptic number.
140324221011 is a deficient number, since it is larger than the sum of its proper divisors (65951431341).
140324221011 is a wasteful number, since it uses less digits than its factorization.
140324221011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40083.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 140324221011 its reverse (110122423041), we get a palindrome (250446644052).
The spelling of 140324221011 in words is "one hundred forty billion, three hundred twenty-four million, two hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •