Base | Representation |
---|---|
bin | 1101111110000011110110… |
… | …10001110011101110010000 |
3 | 11000202202211220222112210021 |
4 | 12333001323101303232100 |
5 | 13011302343114214424 |
6 | 145200231254313224 |
7 | 6320265111520000 |
oct | 677017321635620 |
9 | 130682756875707 |
10 | 30719674366864 |
11 | 987416035777a |
12 | 3541818958814 |
13 | 141ab1197c892 |
14 | 782ba9610000 |
15 | 3841512284e4 |
hex | 1bf07b473b90 |
30719674366864 has 400 divisors, whose sum is σ = 73488534647040. Its totient is φ = 12425773301760.
The previous prime is 30719674366859. The next prime is 30719674366877. The reversal of 30719674366864 is 46866347691703.
It is a super-2 number, since 2×307196743668642 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30719674366793 and 30719674366802.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 5645958384 + ... + 5645963824.
Almost surely, 230719674366864 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30719674366864, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36744267323520).
30719674366864 is an abundant number, since it is smaller than the sum of its proper divisors (42768860280176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30719674366864 is an equidigital number, since it uses as much as digits as its factorization.
30719674366864 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5636 (or 5609 counting only the distinct ones).
The product of its (nonzero) digits is 658409472, while the sum is 70.
The spelling of 30719674366864 in words is "thirty trillion, seven hundred nineteen billion, six hundred seventy-four million, three hundred sixty-six thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.399 sec. • engine limits •