Base | Representation |
---|---|
bin | 101011110111000001100… |
… | …110010001111010001010 |
3 | 101200010201020120202111220 |
4 | 223313001212101322022 |
5 | 343340203122041020 |
6 | 10224342143102510 |
7 | 430520141146155 |
oct | 53670146217212 |
9 | 11603636522456 |
10 | 3014020112010 |
11 | a62269861406 |
12 | 4081792a1a36 |
13 | 18b2b436117b |
14 | a5c44d26c9c |
15 | 536054eb240 |
hex | 2bdc1991e8a |
3014020112010 has 32 divisors (see below), whose sum is σ = 7239534157440. Its totient is φ = 803084708928.
The previous prime is 3014020111979. The next prime is 3014020112017. The reversal of 3014020112010 is 102110204103.
3014020112010 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is not an unprimeable number, because it can be changed into a prime (3014020112017) 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, 40836742 + ... + 40910481.
It is an arithmetic number, because the mean of its divisors is an integer number (226235442420).
Almost surely, 23014020112010 is an apocalyptic number.
3014020112010 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
3014020112010 is an abundant number, since it is smaller than the sum of its proper divisors (4225514045430).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3014020112010 is a wasteful number, since it uses less digits than its factorization.
3014020112010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81748462.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 3014020112010 its reverse (102110204103), we get a palindrome (3116130316113).
The spelling of 3014020112010 in words is "three trillion, fourteen billion, twenty million, one hundred twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •