Base | Representation |
---|---|
bin | 1001010001110000000000… |
… | …11000010100100000001000 |
3 | 2200020022210210211001211111 |
4 | 10220320000120110200020 |
5 | 10133222423331001212 |
6 | 111220045245140104 |
7 | 4203634205363032 |
oct | 450700030244010 |
9 | 80208723731744 |
10 | 20401101031432 |
11 | 6556070749670 |
12 | 2355a5355a634 |
13 | b4ca7aa74364 |
14 | 5075c074ac52 |
15 | 255a2d26aea7 |
hex | 128e00614808 |
20401101031432 has 64 divisors (see below), whose sum is σ = 43620900249600. Its totient is φ = 8860495176000.
The previous prime is 20401101031429. The next prime is 20401101031439. The reversal of 20401101031432 is 23413010110402.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is not an unprimeable number, because it can be changed into a prime (20401101031439) 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, 47116194 + ... + 47547217.
It is an arithmetic number, because the mean of its divisors is an integer number (681576566400).
Almost surely, 220401101031432 is an apocalyptic number.
20401101031432 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
20401101031432 is an abundant number, since it is smaller than the sum of its proper divisors (23219799218168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20401101031432 is a wasteful number, since it uses less digits than its factorization.
20401101031432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 94663538 (or 94663534 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 20401101031432 its reverse (23413010110402), we get a palindrome (43814111141834).
The spelling of 20401101031432 in words is "twenty trillion, four hundred one billion, one hundred one million, thirty-one thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •