Base | Representation |
---|---|
bin | 100000011000011110101… |
… | …0101101000100111100111 |
3 | 120202110211000200122121120 |
4 | 1000300331111220213213 |
5 | 1040404324442401411 |
6 | 13244330121345023 |
7 | 636355252004424 |
oct | 100607525504747 |
9 | 16673730618546 |
10 | 4450615200231 |
11 | 146654a287062 |
12 | 5ba686038173 |
13 | 2638ca794ba5 |
14 | 1155a7814d4b |
15 | 7ab8626a106 |
hex | 40c3d5689e7 |
4450615200231 has 16 divisors (see below), whose sum is σ = 5946013532160. Its totient is φ = 2961152480160.
The previous prime is 4450615200191. The next prime is 4450615200299. The reversal of 4450615200231 is 1320025160544.
4450615200231 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 4450615200231 - 27 = 4450615200103 is a prime.
It is a super-2 number, since 2×44506152002312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4450615200192 and 4450615200201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4450615250231) 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, 2453161 + ... + 3862541.
It is an arithmetic number, because the mean of its divisors is an integer number (371625845760).
Almost surely, 24450615200231 is an apocalyptic number.
4450615200231 is a deficient number, since it is larger than the sum of its proper divisors (1495398331929).
4450615200231 is a wasteful number, since it uses less digits than its factorization.
4450615200231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1411486.
The product of its (nonzero) digits is 28800, while the sum is 33.
The spelling of 4450615200231 in words is "four trillion, four hundred fifty billion, six hundred fifteen million, two hundred thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •