Base | Representation |
---|---|
bin | 1001001110010010100111… |
… | …0110111110001010010111 |
3 | 1022220111000002112011221011 |
4 | 2103210221312332022113 |
5 | 2312123003213441403 |
6 | 33322433301433051 |
7 | 2064446260154632 |
oct | 223445166761227 |
9 | 38814002464834 |
10 | 10141120062103 |
11 | 325a908995418 |
12 | 117950070b787 |
13 | 5873c3aa3954 |
14 | 270b933dcc19 |
15 | 128bd915ea6d |
hex | 93929dbe297 |
10141120062103 has 4 divisors (see below), whose sum is σ = 10142036080768. Its totient is φ = 10140204043440.
The previous prime is 10141120062083. The next prime is 10141120062113. The reversal of 10141120062103 is 30126002114101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10141120062103 - 229 = 10140583191191 is a prime.
It is a super-2 number, since 2×101411200621032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10141120062113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 457992726 + ... + 458014867.
It is an arithmetic number, because the mean of its divisors is an integer number (2535509020192).
Almost surely, 210141120062103 is an apocalyptic number.
10141120062103 is a deficient number, since it is larger than the sum of its proper divisors (916018665).
10141120062103 is an equidigital number, since it uses as much as digits as its factorization.
10141120062103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 916018664.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 10141120062103 its reverse (30126002114101), we get a palindrome (40267122176204).
The spelling of 10141120062103 in words is "ten trillion, one hundred forty-one billion, one hundred twenty million, sixty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •