Base | Representation |
---|---|
bin | 10100010111111000000… |
… | …100100100111001110100 |
3 | 11221211201020112000102012 |
4 | 110113320010210321310 |
5 | 140414223214224000 |
6 | 2551055130503352 |
7 | 203101646242133 |
oct | 24277004447164 |
9 | 4854636460365 |
10 | 1400026320500 |
11 | 49a8253a5275 |
12 | 1a7401b94b58 |
13 | a20391c1132 |
14 | 4ba93cdb91a |
15 | 2664060d735 |
hex | 145f8124e74 |
1400026320500 has 48 divisors (see below), whose sum is σ = 3058243113744. Its totient is φ = 559903270400.
The previous prime is 1400026320487. The next prime is 1400026320521. The reversal of 1400026320500 is 50236200041.
It can be written as a sum of positive squares in 8 ways, for example, as 585130143844 + 814896176656 = 764938^2 + 902716^2 .
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 2370992 + ... + 2902008.
It is an arithmetic number, because the mean of its divisors is an integer number (63713398203).
Almost surely, 21400026320500 is an apocalyptic number.
1400026320500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1400026320500 is an abundant number, since it is smaller than the sum of its proper divisors (1658216793244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1400026320500 is a wasteful number, since it uses less digits than its factorization.
1400026320500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 536309 (or 536297 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 23.
The spelling of 1400026320500 in words is "one trillion, four hundred billion, twenty-six million, three hundred twenty thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •