Base | Representation |
---|---|
bin | 1001001001110000001101… |
… | …10000011010011011000100 |
3 | 2122021001120112211200200200 |
4 | 10210320012300122123010 |
5 | 10114222211001302432 |
6 | 110445524114410500 |
7 | 4145036136131334 |
oct | 444700660323304 |
9 | 78231515750620 |
10 | 20126330103492 |
11 | 645a58a718648 |
12 | 231074b290a30 |
13 | b2cb9ba74a72 |
14 | 4d81961810c4 |
15 | 24d7ea92ca7c |
hex | 124e06c1a6c4 |
20126330103492 has 36 divisors (see below), whose sum is σ = 51957334455936. Its totient is φ = 6566036770800.
The previous prime is 20126330103437. The next prime is 20126330103493. The reversal of 20126330103492 is 29430103362102.
20126330103492 is a `hidden beast` number, since 2 + 0 + 1 + 2 + 6 + 3 + 301 + 0 + 349 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (20126330103493) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5947495384 + ... + 5947498767.
Almost surely, 220126330103492 is an apocalyptic number.
It is an amenable number.
20126330103492 is an abundant number, since it is smaller than the sum of its proper divisors (31831004352444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20126330103492 is a wasteful number, since it uses less digits than its factorization.
20126330103492 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11894994208 (or 11894994203 counting only the distinct ones).
The product of its (nonzero) digits is 46656, while the sum is 36.
Adding to 20126330103492 its reverse (29430103362102), we get a palindrome (49556433465594).
The spelling of 20126330103492 in words is "twenty trillion, one hundred twenty-six billion, three hundred thirty million, one hundred three thousand, four hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.209 sec. • engine limits •