Base | Representation |
---|---|
bin | 1101110010001010101100… |
… | …01100100001101010000000 |
3 | 10222022201001211010201012020 |
4 | 12321011112030201222000 |
5 | 12433103442231111112 |
6 | 144244410050401440 |
7 | 6245620405525152 |
oct | 671052614415200 |
9 | 128281054121166 |
10 | 30311030332032 |
11 | 972692146303a |
12 | 3496592890280 |
13 | 13bb419555638 |
14 | 76b0c1416ad2 |
15 | 3786d5a1948c |
hex | 1b9156321a80 |
30311030332032 has 64 divisors (see below), whose sum is σ = 80540850368160. Its totient is φ = 10100266449920.
The previous prime is 30311030332003. The next prime is 30311030332049. The reversal of 30311030332032 is 23023303011303.
It is a tau number, because it is divible by the number of its divisors (64).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 30311030331993 and 30311030332011.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12182319 + ... + 14457902.
Almost surely, 230311030332032 is an apocalyptic number.
30311030332032 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
30311030332032 is an abundant number, since it is smaller than the sum of its proper divisors (50229820036128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30311030332032 is a wasteful number, since it uses less digits than its factorization.
30311030332032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26643201 (or 26643189 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 24.
Adding to 30311030332032 its reverse (23023303011303), we get a palindrome (53334333343335).
The spelling of 30311030332032 in words is "thirty trillion, three hundred eleven billion, thirty million, three hundred thirty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •