Base | Representation |
---|---|
bin | 111101011101111010… |
… | …0000111101110110111 |
3 | 110121201022022212020122 |
4 | 1322323310013232313 |
5 | 4130314001141211 |
6 | 140350122322155 |
7 | 12352040445425 |
oct | 1727364075667 |
9 | 417638285218 |
10 | 132000021431 |
11 | 50a87630903 |
12 | 216ba65935b |
13 | c5a8358875 |
14 | 6562d6c115 |
15 | 367872c6db |
hex | 1ebbd07bb7 |
132000021431 has 12 divisors (see below), whose sum is σ = 147601559880. Its totient is φ = 117696608640.
The previous prime is 132000021427. The next prime is 132000021449. The reversal of 132000021431 is 134120000231.
It is not a de Polignac number, because 132000021431 - 22 = 132000021427 is a prime.
It is a super-2 number, since 2×1320000214312 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132000021631) 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, 12014180 + ... + 12025161.
It is an arithmetic number, because the mean of its divisors is an integer number (12300129990).
Almost surely, 2132000021431 is an apocalyptic number.
132000021431 is a deficient number, since it is larger than the sum of its proper divisors (15601538449).
132000021431 is a wasteful number, since it uses less digits than its factorization.
132000021431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24039394 (or 24039377 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 132000021431 its reverse (134120000231), we get a palindrome (266120021662).
It can be divided in two parts, 1320000 and 21431, that added together give a palindrome (1341431).
The spelling of 132000021431 in words is "one hundred thirty-two billion, twenty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •