Base | Representation |
---|---|
bin | 100010011011100010000… |
… | …001101101011110011110 |
3 | 22101012010021210021121210 |
4 | 202123202001231132132 |
5 | 302231104133041110 |
6 | 5010534140005250 |
7 | 332640166060065 |
oct | 42334201553636 |
9 | 8335107707553 |
10 | 2366024112030 |
11 | 832474a24727 |
12 | 322674830826 |
13 | 142165babb97 |
14 | 8273256d1dc |
15 | 4182bbdb520 |
hex | 226e206d79e |
2366024112030 has 32 divisors (see below), whose sum is σ = 5678542685088. Its totient is φ = 630930339200.
The previous prime is 2366024111999. The next prime is 2366024112061. The reversal of 2366024112030 is 302114206632.
2366024112030 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (2366024111999) and next prime (2366024112061).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1584460 + ... + 2691200.
It is an arithmetic number, because the mean of its divisors is an integer number (177454458909).
Almost surely, 22366024112030 is an apocalyptic number.
2366024112030 is an abundant number, since it is smaller than the sum of its proper divisors (3312518573058).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2366024112030 is a wasteful number, since it uses less digits than its factorization.
2366024112030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1178012.
The product of its (nonzero) digits is 10368, while the sum is 30.
Adding to 2366024112030 its reverse (302114206632), we get a palindrome (2668138318662).
The spelling of 2366024112030 in words is "two trillion, three hundred sixty-six billion, twenty-four million, one hundred twelve thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •