Base | Representation |
---|---|
bin | 10111001100100000010000… |
… | …000110011000000001110010 |
3 | 111101012110211021211112201202 |
4 | 113030200100012120001302 |
5 | 101332400323312240310 |
6 | 1000544423204331202 |
7 | 30326202164646203 |
oct | 2714402006300162 |
9 | 441173737745652 |
10 | 102014333321330 |
11 | 2a561043719471 |
12 | b5370899a3b02 |
13 | 44bcbab082931 |
14 | 1b2973d1435aa |
15 | bbd960cc23a5 |
hex | 5cc810198072 |
102014333321330 has 64 divisors (see below), whose sum is σ = 194434201146240. Its totient is φ = 38470739457024.
The previous prime is 102014333321323. The next prime is 102014333321339. The reversal of 102014333321330 is 33123333410201.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a junction number, because it is equal to n+sod(n) for n = 102014333321293 and 102014333321302.
It is not an unprimeable number, because it can be changed into a prime (102014333321339) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 40001402 + ... + 42475178.
It is an arithmetic number, because the mean of its divisors is an integer number (3038034392910).
Almost surely, 2102014333321330 is an apocalyptic number.
102014333321330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102014333321330 is a deficient number, since it is larger than the sum of its proper divisors (92419867824910).
102014333321330 is a wasteful number, since it uses less digits than its factorization.
102014333321330 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2477163.
The product of its (nonzero) digits is 11664, while the sum is 29.
Adding to 102014333321330 its reverse (33123333410201), we get a palindrome (135137666731531).
The spelling of 102014333321330 in words is "one hundred two trillion, fourteen billion, three hundred thirty-three million, three hundred twenty-one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •