Base | Representation |
---|---|
bin | 111100101110010110… |
… | …1000010111000011000 |
3 | 110110121002202101112020 |
4 | 1321130231002320120 |
5 | 4114032002043112 |
6 | 135523521214440 |
7 | 12264353345013 |
oct | 1713455027030 |
9 | 413532671466 |
10 | 130404331032 |
11 | 50338933008 |
12 | 21334191420 |
13 | c3b28a1571 |
14 | 645107a37a |
15 | 35d35d048c |
hex | 1e5cb42e18 |
130404331032 has 16 divisors (see below), whose sum is σ = 326010827640. Its totient is φ = 43468110336.
The previous prime is 130404330989. The next prime is 130404331061. The reversal of 130404331032 is 230133404031.
It is a Harshad number since it is a multiple of its sum of digits (24), and also a Moran number because the ratio is a prime number: 5433513793 = 130404331032 / (1 + 3 + 0 + 4 + 0 + 4 + 3 + 3 + 1 + 0 + 3 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 130404330993 and 130404331011.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2716756873 + ... + 2716756920.
Almost surely, 2130404331032 is an apocalyptic number.
130404331032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
130404331032 is an abundant number, since it is smaller than the sum of its proper divisors (195606496608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130404331032 is a wasteful number, since it uses less digits than its factorization.
130404331032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5433513802 (or 5433513798 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 130404331032 its reverse (230133404031), we get a palindrome (360537735063).
The spelling of 130404331032 in words is "one hundred thirty billion, four hundred four million, three hundred thirty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •