Base | Representation |
---|---|
bin | 1101110001111000100110… |
… | …11010101000000000110111 |
3 | 10222021210000002110202021201 |
4 | 12320330103122220000313 |
5 | 12432424100411120043 |
6 | 144240122332553331 |
7 | 6245124646323463 |
oct | 670742332500067 |
9 | 128253002422251 |
10 | 30301320020023 |
11 | 9722799219998 |
12 | 3494722922847 |
13 | 13ba52c8953a0 |
14 | 76a83d9414a3 |
15 | 3783182cec4d |
hex | 1b8f136a8037 |
30301320020023 has 8 divisors (see below), whose sum is σ = 32694824561616. Its totient is φ = 27916763160000.
The previous prime is 30301320019991. The next prime is 30301320020047. The reversal of 30301320020023 is 32002002310303.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30301320020023 - 25 = 30301320019991 is a prime.
It is a super-2 number, since 2×303013200200232 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30301320020063) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2236913353 + ... + 2236926898.
It is an arithmetic number, because the mean of its divisors is an integer number (4086853070202).
Almost surely, 230301320020023 is an apocalyptic number.
30301320020023 is a deficient number, since it is larger than the sum of its proper divisors (2393504541593).
30301320020023 is a wasteful number, since it uses less digits than its factorization.
30301320020023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4473840785.
The product of its (nonzero) digits is 648, while the sum is 19.
Adding to 30301320020023 its reverse (32002002310303), we get a palindrome (62303322330326).
The spelling of 30301320020023 in words is "thirty trillion, three hundred one billion, three hundred twenty million, twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •