Search a number
-
+
110010011111012 = 2255163498567931
BaseRepresentation
bin11001000000110110110011…
…101000100100111001100100
3112102111212001211012220200102
4121000312303220210321210
5103404401000321023022
61025545522412403232
732112650425536245
oct3100666350447144
9472455054186612
10110010011111012
1132063a90354061
1210408816176518
13494cb9037c09c
141d24727756ccc
15cab92d567a92
hex640db3a24e64

110010011111012 has 12 divisors (see below), whose sum is σ = 192521009805936. Its totient is φ = 55004008309320.

The previous prime is 110010011110999. The next prime is 110010011111131. The reversal of 110010011111012 is 210111110010011.

It is a happy number.

It is a junction number, because it is equal to n+sod(n) for n = 110010011110984 and 110010011111002.

It is an unprimeable number.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 249063314 + ... + 249504617.

It is an arithmetic number, because the mean of its divisors is an integer number (16043417483828).

Almost surely, 2110010011111012 is an apocalyptic number.

It is an amenable number.

110010011111012 is a deficient number, since it is larger than the sum of its proper divisors (82510998694924).

110010011111012 is a wasteful number, since it uses less digits than its factorization.

110010011111012 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 498623098 (or 498623096 counting only the distinct ones).

The product of its (nonzero) digits is 2, while the sum is 11.

Adding to 110010011111012 its reverse (210111110010011), we get a palindrome (320121121121023).

The spelling of 110010011111012 in words is "one hundred ten trillion, ten billion, eleven million, one hundred eleven thousand, twelve".

Divisors: 1 2 4 55163 110326 220652 498567931 997135862 1994271724 27502502777753 55005005555506 110010011111012