Base | Representation |
---|---|
bin | 1100110000110110000111… |
… | …1001011111010010001010 |
3 | 1211200120101211220112112220 |
4 | 3030031201321133102022 |
5 | 3314410144424210310 |
6 | 45502450450514510 |
7 | 2645605162046412 |
oct | 314154171372212 |
9 | 54616354815486 |
10 | 14033300616330 |
11 | 4520542394606 |
12 | 16a78b7b95a36 |
13 | 7aa447085a58 |
14 | 367302db3642 |
15 | 19508969c670 |
hex | cc361e5f48a |
14033300616330 has 64 divisors (see below), whose sum is σ = 33852284339328. Its totient is φ = 3723088486400.
The previous prime is 14033300616323. The next prime is 14033300616343. The reversal of 14033300616330 is 3361600333041.
14033300616330 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 14033300616291 and 14033300616300.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7682005 + ... + 9331655.
It is an arithmetic number, because the mean of its divisors is an integer number (528941942802).
Almost surely, 214033300616330 is an apocalyptic number.
14033300616330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14033300616330 is an abundant number, since it is smaller than the sum of its proper divisors (19818983722998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14033300616330 is a wasteful number, since it uses less digits than its factorization.
14033300616330 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1651111.
The product of its (nonzero) digits is 34992, while the sum is 33.
Adding to 14033300616330 its reverse (3361600333041), we get a palindrome (17394900949371).
The spelling of 14033300616330 in words is "fourteen trillion, thirty-three billion, three hundred million, six hundred sixteen thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •