Base | Representation |
---|---|
bin | 1001010011010000111000… |
… | …00001000101100010011110 |
3 | 2200102022001000011100121210 |
4 | 10221220130001011202132 |
5 | 10140100424200413210 |
6 | 111300005412005250 |
7 | 4210454664065241 |
oct | 451503401054236 |
9 | 80368030140553 |
10 | 20453104310430 |
11 | 65761271988a0 |
12 | 2363b47300826 |
13 | b54947868a6c |
14 | 509d1514b258 |
15 | 25707391ee20 |
hex | 129a1c04589e |
20453104310430 has 128 divisors (see below), whose sum is σ = 53721990153216. Its totient is φ = 4942420761600.
The previous prime is 20453104310411. The next prime is 20453104310461. The reversal of 20453104310430 is 3401340135402.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 147040194 + ... + 147179226.
It is an arithmetic number, because the mean of its divisors is an integer number (419703048072).
Almost surely, 220453104310430 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20453104310430, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26860995076608).
20453104310430 is an abundant number, since it is smaller than the sum of its proper divisors (33268885842786).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20453104310430 is a wasteful number, since it uses less digits than its factorization.
20453104310430 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 140482.
The product of its (nonzero) digits is 17280, while the sum is 30.
Adding to 20453104310430 its reverse (3401340135402), we get a palindrome (23854444445832).
The spelling of 20453104310430 in words is "twenty trillion, four hundred fifty-three billion, one hundred four million, three hundred ten thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •