Base | Representation |
---|---|
bin | 11101011101010000111… |
… | …00110100001000010011 |
3 | 10120202112000110010002000 |
4 | 32232220130310020103 |
5 | 113040332210043103 |
6 | 2052550002325043 |
7 | 133060600202244 |
oct | 16565034641023 |
9 | 3522460403060 |
10 | 1012143440403 |
11 | 36027a649457 |
12 | 1441b0959783 |
13 | 745a2073634 |
14 | 36db9122ccb |
15 | 1b4dc8bcaa3 |
hex | eba8734213 |
1012143440403 has 32 divisors (see below), whose sum is σ = 1552124190720. Its totient is φ = 651355901280.
The previous prime is 1012143440393. The next prime is 1012143440449. The reversal of 1012143440403 is 3040443412101.
1012143440403 is a `hidden beast` number, since 1 + 0 + 1 + 214 + 3 + 4 + 40 + 403 = 666.
It is not a de Polignac number, because 1012143440403 - 24 = 1012143440387 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (1012143441403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3861933 + ... + 4115678.
It is an arithmetic number, because the mean of its divisors is an integer number (48503880960).
Almost surely, 21012143440403 is an apocalyptic number.
1012143440403 is a deficient number, since it is larger than the sum of its proper divisors (539980750317).
1012143440403 is a wasteful number, since it uses less digits than its factorization.
1012143440403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7977784 (or 7977778 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 1012143440403 its reverse (3040443412101), we get a palindrome (4052586852504).
The spelling of 1012143440403 in words is "one trillion, twelve billion, one hundred forty-three million, four hundred forty thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •