Base | Representation |
---|---|
bin | 1001001001110111011110… |
… | …01101011011010100000000 |
3 | 2122021102122100020011002122 |
4 | 10210323233031123110000 |
5 | 10114303202341222144 |
6 | 110451411111303412 |
7 | 4145234602660313 |
oct | 444735715332400 |
9 | 78242570204078 |
10 | 20130230023424 |
11 | 6461201066174 |
12 | 231145937ab68 |
13 | b30370a253b1 |
14 | 4d84460c297a |
15 | 24d977ed47ee |
hex | 124eef35b500 |
20130230023424 has 36 divisors (see below), whose sum is σ = 40183105499124. Its totient is φ = 10064794595328.
The previous prime is 20130230023381. The next prime is 20130230023427. The reversal of 20130230023424 is 42432003203102.
It can be written as a sum of positive squares in 2 ways, for example, as 16254056583424 + 3876173440000 = 4031632^2 + 1968800^2 .
It is a super-2 number, since 2×201302300234242 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20130230023393 and 20130230023402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20130230023427) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6909434 + ... + 9380870.
Almost surely, 220130230023424 is an apocalyptic number.
It is an amenable number.
20130230023424 is a deficient number, since it is larger than the sum of its proper divisors (20052875475700).
20130230023424 is an equidigital number, since it uses as much as digits as its factorization.
20130230023424 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2503270 (or 2503256 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 26.
Adding to 20130230023424 its reverse (42432003203102), we get a palindrome (62562233226526).
The spelling of 20130230023424 in words is "twenty trillion, one hundred thirty billion, two hundred thirty million, twenty-three thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •