Base | Representation |
---|---|
bin | 1001001000111001011… |
… | …01001110011000001110 |
3 | 1010000112012011200020210 |
4 | 10210130231032120032 |
5 | 20121100120330110 |
6 | 400131154423250 |
7 | 31454364626004 |
oct | 4443455163016 |
9 | 1100465150223 |
10 | 314014230030 |
11 | 111199934796 |
12 | 50a36891b26 |
13 | 237c4380807 |
14 | 112ac480a74 |
15 | 827cba3520 |
hex | 491cb4e60e |
314014230030 has 32 divisors (see below), whose sum is σ = 786400856064. Its totient is φ = 80096383136.
The previous prime is 314014230001. The next prime is 314014230031. The reversal of 314014230030 is 30032410413.
It is a super-2 number, since 2×3140142300302 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 314014229979 and 314014230006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (314014230031) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 227545854 + ... + 227547233.
It is an arithmetic number, because the mean of its divisors is an integer number (24575026752).
Almost surely, 2314014230030 is an apocalyptic number.
314014230030 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
314014230030 is an abundant number, since it is smaller than the sum of its proper divisors (472386626034).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
314014230030 is a wasteful number, since it uses less digits than its factorization.
314014230030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 455093120.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 314014230030 its reverse (30032410413), we get a palindrome (344046640443).
The spelling of 314014230030 in words is "three hundred fourteen billion, fourteen million, two hundred thirty thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •