Base | Representation |
---|---|
bin | 11101011110110111011… |
… | …11111110011100110000 |
3 | 10120211201222221020001010 |
4 | 32233123233332130300 |
5 | 113044113022221144 |
6 | 2053211225310520 |
7 | 133121120535120 |
oct | 16573357763460 |
9 | 3524658836033 |
10 | 1013004101424 |
11 | 360681451857 |
12 | 1443b1035440 |
13 | 746ab475303 |
14 | 3705b55cc80 |
15 | 1b53d2285b9 |
hex | ebdbbfe730 |
1013004101424 has 40 divisors (see below), whose sum is σ = 2990774014720. Its totient is φ = 289429743168.
The previous prime is 1013004101413. The next prime is 1013004101443. The reversal of 1013004101424 is 4241014003101.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 1013004101424.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1507446244 + ... + 1507446915.
It is an arithmetic number, because the mean of its divisors is an integer number (74769350368).
Almost surely, 21013004101424 is an apocalyptic number.
1013004101424 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
1013004101424 is an abundant number, since it is smaller than the sum of its proper divisors (1977769913296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1013004101424 is a wasteful number, since it uses less digits than its factorization.
1013004101424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3014893177 (or 3014893171 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 1013004101424 its reverse (4241014003101), we get a palindrome (5254018104525).
The spelling of 1013004101424 in words is "one trillion, thirteen billion, four million, one hundred one thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •